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-07 21:29:11,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:29:11,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:29:11,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:29:11,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:29:11,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:29:11,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:29:11,414 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:29:11,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:29:11,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:29:11,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:29:11,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:29:11,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:29:11,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:29:11,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:29:11,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:29:11,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:29:11,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:29:11,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:29:11,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:29:11,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:29:11,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:29:11,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:29:11,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:29:11,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:29:11,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:29:11,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:29:11,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:29:11,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:29:11,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:29:11,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:29:11,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:29:11,451 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:29:11,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:29:11,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:29:11,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:29:11,455 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-07 21:29:11,480 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:29:11,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:29:11,481 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:29:11,481 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:29:11,482 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:29:11,482 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:29:11,482 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:29:11,482 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:29:11,483 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:29:11,483 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:29:11,483 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:29:11,483 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:29:11,483 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:29:11,483 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:29:11,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:29:11,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:29:11,484 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:29:11,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:29:11,485 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:29:11,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:29:11,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:29:11,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:29:11,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:29:11,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:29:11,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:29:11,486 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:29:11,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:29:11,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:29:11,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:29:11,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:29:11,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:29:11,489 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:29:11,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:29:11,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:29:11,489 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:29:11,489 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:29:11,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:29:11,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:29:11,490 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:29:11,490 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:29:11,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:29:11,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:29:11,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:29:11,551 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:29:11,552 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:29:11,553 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-07 21:29:11,553 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-01-07 21:29:11,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:29:11,608 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:29:11,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:11,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:29:11,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:29:11,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:11,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:29:11,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:29:11,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:29:11,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... [2019-01-07 21:29:11,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:29:11,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:29:11,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:29:11,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:29:11,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:29:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:29:11,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:29:12,090 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:29:12,091 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-07 21:29:12,092 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:12 BoogieIcfgContainer [2019-01-07 21:29:12,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:29:12,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:29:12,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:29:12,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:29:12,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:11" (1/2) ... [2019-01-07 21:29:12,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e17060d and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:29:12, skipping insertion in model container [2019-01-07 21:29:12,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:12" (2/2) ... [2019-01-07 21:29:12,101 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-01-07 21:29:12,110 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:29:12,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-07 21:29:12,133 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-07 21:29:12,167 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:29:12,167 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:29:12,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:29:12,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:29:12,168 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:29:12,168 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:29:12,168 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:29:12,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:29:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-07 21:29:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:29:12,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:12,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:29:12,193 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2019-01-07 21:29:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:12,419 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-07 21:29:12,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:12,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:29:12,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:12,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:29:12,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:29:12,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:29:12,440 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-01-07 21:29:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:12,559 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-07 21:29:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:29:12,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 21:29:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:12,572 INFO L225 Difference]: With dead ends: 24 [2019-01-07 21:29:12,572 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 21:29:12,575 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-07 21:29:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 21:29:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-07 21:29:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 21:29:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-07 21:29:12,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-01-07 21:29:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:12,611 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-07 21:29:12,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:29:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-07 21:29:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:29:12,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:12,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:29:12,613 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2019-01-07 21:29:12,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:12,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:12,938 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-07 21:29:12,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:12,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:29:12,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:12,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:29:12,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:29:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:29:12,942 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-01-07 21:29:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:13,208 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-07 21:29:13,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:29:13,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-07 21:29:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:13,210 INFO L225 Difference]: With dead ends: 18 [2019-01-07 21:29:13,210 INFO L226 Difference]: Without dead ends: 17 [2019-01-07 21:29:13,212 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-07 21:29:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-07 21:29:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-07 21:29:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 21:29:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-07 21:29:13,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2019-01-07 21:29:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:13,217 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-07 21:29:13,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:29:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-07 21:29:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:29:13,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:13,219 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:29:13,219 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2019-01-07 21:29:13,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,280 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-07 21:29:13,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:13,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:29:13,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:13,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:29:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:29:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:29:13,282 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-01-07 21:29:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:13,313 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-07 21:29:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:29:13,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-07 21:29:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:13,314 INFO L225 Difference]: With dead ends: 19 [2019-01-07 21:29:13,315 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 21:29:13,315 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-07 21:29:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 21:29:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 21:29:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 21:29:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-07 21:29:13,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-07 21:29:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:13,319 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-07 21:29:13,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:29:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 21:29:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-07 21:29:13,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:13,320 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-07 21:29:13,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2019-01-07 21:29:13,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:13,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:13,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,593 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-07 21:29:13,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:13,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:13,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-01-07 21:29:13,597 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [11], [12], [13], [21] [2019-01-07 21:29:13,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:29:13,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:29:13,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:29:13,795 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-07 21:29:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:13,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:29:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:13,803 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-07 21:29:13,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:13,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:14,005 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-07 21:29:14,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,037 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-07 21:29:14,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:14,188 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-07 21:29:14,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:14,288 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-07 21:29:14,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:14,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-07 21:29:14,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:14,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:29:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:29:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:29:14,312 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-01-07 21:29:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:14,616 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-07 21:29:14,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:29:14,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-07 21:29:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:14,618 INFO L225 Difference]: With dead ends: 21 [2019-01-07 21:29:14,618 INFO L226 Difference]: Without dead ends: 20 [2019-01-07 21:29:14,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:29:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-07 21:29:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-07 21:29:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:29:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-07 21:29:14,626 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2019-01-07 21:29:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:14,626 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-07 21:29:14,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:29:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-07 21:29:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-07 21:29:14,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:14,628 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-01-07 21:29:14,628 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2019-01-07 21:29:14,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:14,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:14,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:14,764 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-07 21:29:14,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:14,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:14,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:14,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:14,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:14,766 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-07 21:29:14,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:14,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:14,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:29:14,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:14,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:14,823 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-07 21:29:14,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,832 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-07 21:29:14,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:15,262 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-07 21:29:15,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:15,436 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-07 21:29:15,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:15,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-01-07 21:29:15,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:29:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:29:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:29:15,459 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-07 21:29:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:15,642 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-07 21:29:15,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:29:15,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-07 21:29:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:15,643 INFO L225 Difference]: With dead ends: 26 [2019-01-07 21:29:15,643 INFO L226 Difference]: Without dead ends: 25 [2019-01-07 21:29:15,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:29:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-07 21:29:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-01-07 21:29:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-07 21:29:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-07 21:29:15,649 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2019-01-07 21:29:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:15,650 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-07 21:29:15,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:29:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-07 21:29:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-07 21:29:15,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:15,651 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2019-01-07 21:29:15,651 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2019-01-07 21:29:15,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:15,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:15,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:15,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:15,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:15,772 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-07 21:29:15,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:15,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:15,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:15,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:15,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:15,774 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-07 21:29:15,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:15,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:15,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:15,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:15,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:15,849 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-07 21:29:15,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:15,923 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-07 21:29:15,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:16,043 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-07 21:29:16,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:16,296 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-07 21:29:16,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:16,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2019-01-07 21:29:16,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:16,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:29:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:29:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:29:16,320 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-01-07 21:29:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:16,559 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-07 21:29:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:29:16,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-07 21:29:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:16,561 INFO L225 Difference]: With dead ends: 31 [2019-01-07 21:29:16,561 INFO L226 Difference]: Without dead ends: 30 [2019-01-07 21:29:16,562 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-07 21:29:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-07 21:29:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-07 21:29:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-07 21:29:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-07 21:29:16,569 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2019-01-07 21:29:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:16,569 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-07 21:29:16,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:29:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-07 21:29:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-07 21:29:16,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:16,570 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2019-01-07 21:29:16,571 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2019-01-07 21:29:16,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:16,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:16,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:16,729 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-07 21:29:16,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:16,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:16,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:16,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:16,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:16,731 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-07 21:29:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:16,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:16,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:16,790 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-07 21:29:16,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:16,815 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-07 21:29:16,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:16,932 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-07 21:29:16,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:17,037 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-07 21:29:17,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:17,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2019-01-07 21:29:17,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:17,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:29:17,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:29:17,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:29:17,065 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-01-07 21:29:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:17,334 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-07 21:29:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:29:17,337 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-07 21:29:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:17,339 INFO L225 Difference]: With dead ends: 36 [2019-01-07 21:29:17,339 INFO L226 Difference]: Without dead ends: 35 [2019-01-07 21:29:17,340 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-07 21:29:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-07 21:29:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-07 21:29:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-07 21:29:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-07 21:29:17,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2019-01-07 21:29:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:17,347 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-07 21:29:17,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:29:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-07 21:29:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-07 21:29:17,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:17,348 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2019-01-07 21:29:17,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2019-01-07 21:29:17,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:17,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:17,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:17,527 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-07 21:29:17,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:17,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:17,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:17,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,528 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-07 21:29:17,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:17,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:17,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-07 21:29:17,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:17,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:17,598 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-07 21:29:17,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:17,620 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-07 21:29:17,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:17,760 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-07 21:29:17,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:17,911 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-07 21:29:17,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:17,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2019-01-07 21:29:17,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:17,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 21:29:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 21:29:17,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:29:17,932 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2019-01-07 21:29:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:18,402 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-07 21:29:18,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:29:18,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-01-07 21:29:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:18,405 INFO L225 Difference]: With dead ends: 41 [2019-01-07 21:29:18,405 INFO L226 Difference]: Without dead ends: 40 [2019-01-07 21:29:18,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=500, Unknown=0, NotChecked=0, Total=812 [2019-01-07 21:29:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-07 21:29:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-07 21:29:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:29:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-07 21:29:18,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2019-01-07 21:29:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:18,414 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-07 21:29:18,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 21:29:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-07 21:29:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-07 21:29:18,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:18,415 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2019-01-07 21:29:18,415 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2019-01-07 21:29:18,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:18,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:18,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:18,937 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-07 21:29:18,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:18,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:18,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:18,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:18,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:18,938 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-07 21:29:18,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:18,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:18,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:18,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:19,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:19,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:19,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:19,022 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-07 21:29:19,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:19,264 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-07 21:29:19,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:19,758 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-07 21:29:19,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:19,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2019-01-07 21:29:19,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:19,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-07 21:29:19,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-07 21:29:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:29:19,779 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2019-01-07 21:29:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:20,191 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-07 21:29:20,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:29:20,196 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-01-07 21:29:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:20,197 INFO L225 Difference]: With dead ends: 46 [2019-01-07 21:29:20,197 INFO L226 Difference]: Without dead ends: 45 [2019-01-07 21:29:20,198 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-07 21:29:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-07 21:29:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-01-07 21:29:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-07 21:29:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-07 21:29:20,206 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2019-01-07 21:29:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-07 21:29:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-07 21:29:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-07 21:29:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-07 21:29:20,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:20,208 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2019-01-07 21:29:20,208 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2019-01-07 21:29:20,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:20,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:20,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:20,410 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-07 21:29:20,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:20,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:20,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:20,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:20,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:20,411 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-07 21:29:20,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:20,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:20,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:20,464 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-07 21:29:20,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:20,480 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-07 21:29:20,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:20,753 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-07 21:29:20,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:20,933 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-07 21:29:20,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:20,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2019-01-07 21:29:20,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:20,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-07 21:29:20,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-07 21:29:20,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2019-01-07 21:29:20,960 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2019-01-07 21:29:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:21,216 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-07 21:29:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:29:21,216 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-01-07 21:29:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:21,218 INFO L225 Difference]: With dead ends: 51 [2019-01-07 21:29:21,218 INFO L226 Difference]: Without dead ends: 50 [2019-01-07 21:29:21,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=517, Invalid=815, Unknown=0, NotChecked=0, Total=1332 [2019-01-07 21:29:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-07 21:29:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-01-07 21:29:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-07 21:29:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-07 21:29:21,229 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2019-01-07 21:29:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:21,230 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-07 21:29:21,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-07 21:29:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-07 21:29:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-07 21:29:21,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:21,231 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2019-01-07 21:29:21,232 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:21,232 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2019-01-07 21:29:21,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:21,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:21,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:21,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:21,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:21,995 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-07 21:29:21,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:21,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:21,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:21,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:21,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:21,996 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-07 21:29:22,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:22,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:22,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-07 21:29:22,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:22,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:22,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-07 21:29:22,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:22,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-07 21:29:22,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:22,265 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-07 21:29:22,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:22,490 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-07 21:29:22,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:22,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2019-01-07 21:29:22,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:22,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-07 21:29:22,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-07 21:29:22,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=605, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:29:22,514 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-01-07 21:29:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:22,932 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-07 21:29:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-07 21:29:22,933 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-01-07 21:29:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:22,934 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:29:22,934 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:29:22,935 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-07 21:29:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:29:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-07 21:29:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-07 21:29:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-07 21:29:22,943 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2019-01-07 21:29:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:22,943 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-07 21:29:22,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-07 21:29:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-07 21:29:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-07 21:29:22,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:22,945 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2019-01-07 21:29:22,945 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2019-01-07 21:29:22,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:22,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:22,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:23,331 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-07 21:29:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:23,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:23,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:23,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:23,332 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-07 21:29:23,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:23,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:23,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:23,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:23,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:23,416 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-07 21:29:23,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:23,423 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-07 21:29:23,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:23,594 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-07 21:29:23,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:23,780 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-07 21:29:23,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:23,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2019-01-07 21:29:23,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:23,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-07 21:29:23,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-07 21:29:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=721, Unknown=0, NotChecked=0, Total=1190 [2019-01-07 21:29:23,803 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2019-01-07 21:29:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:24,334 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-07 21:29:24,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-07 21:29:24,334 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-01-07 21:29:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:24,335 INFO L225 Difference]: With dead ends: 61 [2019-01-07 21:29:24,335 INFO L226 Difference]: Without dead ends: 60 [2019-01-07 21:29:24,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=774, Invalid=1206, Unknown=0, NotChecked=0, Total=1980 [2019-01-07 21:29:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-07 21:29:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-07 21:29:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-07 21:29:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-07 21:29:24,346 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2019-01-07 21:29:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:24,346 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-07 21:29:24,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-07 21:29:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-07 21:29:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-07 21:29:24,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:24,348 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2019-01-07 21:29:24,348 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2019-01-07 21:29:24,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:24,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:24,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:24,579 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-07 21:29:24,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:24,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:24,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:24,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:24,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:24,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 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-07 21:29:24,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:24,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:24,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:24,639 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-07 21:29:24,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:24,652 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-07 21:29:24,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:24,907 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-07 21:29:24,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:25,232 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-07 21:29:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:25,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2019-01-07 21:29:25,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:25,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-07 21:29:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-07 21:29:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=847, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:29:25,256 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-01-07 21:29:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:25,612 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-07 21:29:25,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-07 21:29:25,612 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-01-07 21:29:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:25,613 INFO L225 Difference]: With dead ends: 66 [2019-01-07 21:29:25,614 INFO L226 Difference]: Without dead ends: 65 [2019-01-07 21:29:25,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2019-01-07 21:29:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-07 21:29:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-01-07 21:29:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-07 21:29:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-07 21:29:25,626 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2019-01-07 21:29:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:25,626 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-07 21:29:25,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-07 21:29:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-07 21:29:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-07 21:29:25,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:25,627 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2019-01-07 21:29:25,628 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2019-01-07 21:29:25,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:25,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:25,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:26,089 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-07 21:29:26,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:26,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:26,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:26,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:26,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:26,090 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-07 21:29:26,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:26,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:26,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-07 21:29:26,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:26,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:26,173 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-07 21:29:26,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:26,182 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-07 21:29:26,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:26,404 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-07 21:29:26,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:26,759 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-07 21:29:26,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:26,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2019-01-07 21:29:26,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:26,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-07 21:29:26,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-07 21:29:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=983, Unknown=0, NotChecked=0, Total=1640 [2019-01-07 21:29:26,782 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2019-01-07 21:29:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:27,242 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-07 21:29:27,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-07 21:29:27,243 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-01-07 21:29:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:27,244 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:29:27,244 INFO L226 Difference]: Without dead ends: 70 [2019-01-07 21:29:27,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1083, Invalid=1673, Unknown=0, NotChecked=0, Total=2756 [2019-01-07 21:29:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-07 21:29:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-01-07 21:29:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-07 21:29:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-07 21:29:27,258 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2019-01-07 21:29:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:27,259 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-07 21:29:27,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-07 21:29:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-07 21:29:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-07 21:29:27,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:27,260 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2019-01-07 21:29:27,261 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:27,261 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2019-01-07 21:29:27,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:27,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:27,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:27,779 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-07 21:29:27,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:27,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:27,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:27,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:27,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:27,780 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-07 21:29:27,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:27,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:27,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:27,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:27,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:27,864 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-07 21:29:27,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:27,889 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-07 21:29:27,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:28,449 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-07 21:29:28,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:29,359 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-07 21:29:29,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:29,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2019-01-07 21:29:29,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:29,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-07 21:29:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-07 21:29:29,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=1129, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:29:29,381 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2019-01-07 21:29:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:29,987 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-07 21:29:29,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-07 21:29:29,987 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-01-07 21:29:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:29,988 INFO L225 Difference]: With dead ends: 76 [2019-01-07 21:29:29,988 INFO L226 Difference]: Without dead ends: 75 [2019-01-07 21:29:29,990 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-07 21:29:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-07 21:29:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-01-07 21:29:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-07 21:29:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-07 21:29:30,001 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2019-01-07 21:29:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:30,001 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-07 21:29:30,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-07 21:29:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-07 21:29:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-07 21:29:30,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:30,002 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2019-01-07 21:29:30,003 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:30,003 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2019-01-07 21:29:30,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:30,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:30,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:30,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:30,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:30,314 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-07 21:29:30,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:30,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:30,315 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:30,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:30,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:30,315 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-07 21:29:30,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:30,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:30,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:30,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-07 21:29:30,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:30,405 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-07 21:29:30,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:30,628 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-07 21:29:30,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:30,971 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-07 21:29:30,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:30,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2019-01-07 21:29:30,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:30,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-07 21:29:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-07 21:29:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-01-07 21:29:30,999 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2019-01-07 21:29:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:31,556 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-07 21:29:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-07 21:29:31,556 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-01-07 21:29:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:31,557 INFO L225 Difference]: With dead ends: 81 [2019-01-07 21:29:31,557 INFO L226 Difference]: Without dead ends: 80 [2019-01-07 21:29:31,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1444, Invalid=2216, Unknown=0, NotChecked=0, Total=3660 [2019-01-07 21:29:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-07 21:29:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-07 21:29:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:29:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-07 21:29:31,569 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2019-01-07 21:29:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:31,569 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-07 21:29:31,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-07 21:29:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-07 21:29:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-07 21:29:31,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:31,571 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2019-01-07 21:29:31,571 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2019-01-07 21:29:31,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:31,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:32,107 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-07 21:29:32,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:32,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:32,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:32,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:32,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:32,108 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-07 21:29:32,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:32,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:32,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-07 21:29:32,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:32,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:32,210 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-07 21:29:32,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:32,221 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-07 21:29:32,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:32,826 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-07 21:29:32,847 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-07 21:29:32,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:33,399 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-07 21:29:33,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:33,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2019-01-07 21:29:33,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:33,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-07 21:29:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-07 21:29:33,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=1451, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:29:33,420 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2019-01-07 21:29:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:33,942 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-07 21:29:33,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-07 21:29:33,943 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-01-07 21:29:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:33,944 INFO L225 Difference]: With dead ends: 86 [2019-01-07 21:29:33,944 INFO L226 Difference]: Without dead ends: 85 [2019-01-07 21:29:33,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1644, Invalid=2516, Unknown=0, NotChecked=0, Total=4160 [2019-01-07 21:29:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-07 21:29:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-01-07 21:29:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-07 21:29:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-07 21:29:33,962 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2019-01-07 21:29:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:33,963 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-07 21:29:33,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-07 21:29:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-07 21:29:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-07 21:29:33,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:33,964 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2019-01-07 21:29:33,964 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2019-01-07 21:29:33,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:33,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:33,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:34,436 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-07 21:29:34,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:34,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:34,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:34,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:34,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:34,437 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-07 21:29:34,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:34,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:34,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:34,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:34,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:34,532 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-07 21:29:34,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:34,536 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-07 21:29:34,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:34,785 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-07 21:29:34,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:35,209 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-07 21:29:35,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:35,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2019-01-07 21:29:35,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:35,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-07 21:29:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-07 21:29:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1627, Unknown=0, NotChecked=0, Total=2756 [2019-01-07 21:29:35,230 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2019-01-07 21:29:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:35,781 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-07 21:29:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-07 21:29:35,782 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2019-01-07 21:29:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:35,782 INFO L225 Difference]: With dead ends: 91 [2019-01-07 21:29:35,782 INFO L226 Difference]: Without dead ends: 90 [2019-01-07 21:29:35,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1857, Invalid=2835, Unknown=0, NotChecked=0, Total=4692 [2019-01-07 21:29:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-07 21:29:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-01-07 21:29:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-07 21:29:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-07 21:29:35,796 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2019-01-07 21:29:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:35,796 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-07 21:29:35,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-07 21:29:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-07 21:29:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-07 21:29:35,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:35,797 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2019-01-07 21:29:35,798 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2019-01-07 21:29:35,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:35,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:35,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:35,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:35,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:36,170 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-07 21:29:36,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:36,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:36,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:36,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:36,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:36,171 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-07 21:29:36,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:36,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:36,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:36,263 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-07 21:29:36,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:36,309 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-07 21:29:36,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:36,665 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-07 21:29:36,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:37,113 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-07 21:29:37,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:37,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2019-01-07 21:29:37,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:37,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-07 21:29:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-07 21:29:37,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=1813, Unknown=0, NotChecked=0, Total=3080 [2019-01-07 21:29:37,136 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2019-01-07 21:29:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:37,728 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-07 21:29:37,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-07 21:29:37,729 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-01-07 21:29:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:37,730 INFO L225 Difference]: With dead ends: 96 [2019-01-07 21:29:37,730 INFO L226 Difference]: Without dead ends: 95 [2019-01-07 21:29:37,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2083, Invalid=3173, Unknown=0, NotChecked=0, Total=5256 [2019-01-07 21:29:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-07 21:29:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-07 21:29:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-07 21:29:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-07 21:29:37,741 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2019-01-07 21:29:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:37,741 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-07 21:29:37,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-07 21:29:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-07 21:29:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-07 21:29:37,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:37,742 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2019-01-07 21:29:37,742 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2019-01-07 21:29:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:37,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:37,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:37,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:38,144 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-07 21:29:38,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:38,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:38,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:38,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:38,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:38,145 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-07 21:29:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:38,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:38,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-07 21:29:38,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:38,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:38,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-07 21:29:38,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:38,383 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-07 21:29:38,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:38,777 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-07 21:29:38,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:39,506 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-07 21:29:39,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:39,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2019-01-07 21:29:39,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:39,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-07 21:29:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-07 21:29:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=2009, Unknown=0, NotChecked=0, Total=3422 [2019-01-07 21:29:39,528 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2019-01-07 21:29:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:40,165 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-07 21:29:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-07 21:29:40,166 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2019-01-07 21:29:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:40,166 INFO L225 Difference]: With dead ends: 101 [2019-01-07 21:29:40,166 INFO L226 Difference]: Without dead ends: 100 [2019-01-07 21:29:40,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2322, Invalid=3530, Unknown=0, NotChecked=0, Total=5852 [2019-01-07 21:29:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-07 21:29:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-01-07 21:29:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-07 21:29:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-07 21:29:40,179 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2019-01-07 21:29:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:40,179 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-07 21:29:40,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-07 21:29:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-07 21:29:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-07 21:29:40,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:40,180 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2019-01-07 21:29:40,180 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:40,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2019-01-07 21:29:40,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:40,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:40,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:40,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:40,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:40,510 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-07 21:29:40,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:40,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:40,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:40,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:40,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:40,511 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-07 21:29:40,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:40,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:40,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:40,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:40,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:40,629 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-07 21:29:40,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:40,718 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-07 21:29:40,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:41,084 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-07 21:29:41,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:41,742 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-07 21:29:41,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:41,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2019-01-07 21:29:41,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:41,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-07 21:29:41,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-07 21:29:41,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=2215, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:29:41,763 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2019-01-07 21:29:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:42,433 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-07 21:29:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-07 21:29:42,434 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-01-07 21:29:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:42,435 INFO L225 Difference]: With dead ends: 106 [2019-01-07 21:29:42,435 INFO L226 Difference]: Without dead ends: 105 [2019-01-07 21:29:42,436 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-07 21:29:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-07 21:29:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-01-07 21:29:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-07 21:29:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-07 21:29:42,450 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2019-01-07 21:29:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:42,451 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-07 21:29:42,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-07 21:29:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-07 21:29:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-07 21:29:42,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:42,451 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2019-01-07 21:29:42,451 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2019-01-07 21:29:42,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:42,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:42,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:43,619 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-07 21:29:43,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:43,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:43,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:43,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:43,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:43,620 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-07 21:29:43,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:43,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:43,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:43,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:43,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:43,709 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-07 21:29:43,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:44,106 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-07 21:29:44,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:45,104 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-07 21:29:45,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:45,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2019-01-07 21:29:45,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:45,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-07 21:29:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-07 21:29:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1729, Invalid=2431, Unknown=0, NotChecked=0, Total=4160 [2019-01-07 21:29:45,125 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2019-01-07 21:29:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:45,901 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-07 21:29:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-07 21:29:45,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2019-01-07 21:29:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:45,903 INFO L225 Difference]: With dead ends: 111 [2019-01-07 21:29:45,903 INFO L226 Difference]: Without dead ends: 110 [2019-01-07 21:29:45,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2839, Invalid=4301, Unknown=0, NotChecked=0, Total=7140 [2019-01-07 21:29:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-07 21:29:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-01-07 21:29:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-07 21:29:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-07 21:29:45,916 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2019-01-07 21:29:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:45,916 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-07 21:29:45,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-07 21:29:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-07 21:29:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-07 21:29:45,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:45,917 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2019-01-07 21:29:45,917 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2019-01-07 21:29:45,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:45,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:45,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:45,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:45,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:46,320 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-07 21:29:46,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:46,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:46,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:46,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:46,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:46,321 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-07 21:29:46,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:46,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:46,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-07 21:29:46,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:46,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:46,451 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-07 21:29:46,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:46,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-07 21:29:46,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:46,846 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-07 21:29:46,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:47,679 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-07 21:29:47,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:47,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2019-01-07 21:29:47,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:47,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-07 21:29:47,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-07 21:29:47,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=2657, Unknown=0, NotChecked=0, Total=4556 [2019-01-07 21:29:47,700 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2019-01-07 21:29:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:48,525 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-07 21:29:48,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-07 21:29:48,528 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2019-01-07 21:29:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:48,529 INFO L225 Difference]: With dead ends: 116 [2019-01-07 21:29:48,529 INFO L226 Difference]: Without dead ends: 115 [2019-01-07 21:29:48,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3117, Invalid=4715, Unknown=0, NotChecked=0, Total=7832 [2019-01-07 21:29:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-07 21:29:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-01-07 21:29:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-07 21:29:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-07 21:29:48,543 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2019-01-07 21:29:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:48,543 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-07 21:29:48,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-07 21:29:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-07 21:29:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-07 21:29:48,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:48,544 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2019-01-07 21:29:48,545 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2019-01-07 21:29:48,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:48,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:48,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:48,986 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-07 21:29:48,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:48,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:48,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:48,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:48,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:48,987 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-07 21:29:48,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:48,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:49,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:49,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:49,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:49,091 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-07 21:29:49,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:49,168 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-07 21:29:49,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:49,942 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-07 21:29:49,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:50,703 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-07 21:29:50,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:50,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2019-01-07 21:29:50,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:50,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-07 21:29:50,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-07 21:29:50,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=2893, Unknown=0, NotChecked=0, Total=4970 [2019-01-07 21:29:50,723 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2019-01-07 21:29:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:51,606 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-01-07 21:29:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-07 21:29:51,607 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-01-07 21:29:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:51,608 INFO L225 Difference]: With dead ends: 121 [2019-01-07 21:29:51,608 INFO L226 Difference]: Without dead ends: 120 [2019-01-07 21:29:51,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3408, Invalid=5148, Unknown=0, NotChecked=0, Total=8556 [2019-01-07 21:29:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-07 21:29:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-01-07 21:29:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-07 21:29:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-07 21:29:51,627 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2019-01-07 21:29:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:51,627 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-07 21:29:51,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-07 21:29:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-07 21:29:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-07 21:29:51,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:51,628 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2019-01-07 21:29:51,629 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2019-01-07 21:29:51,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:51,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:51,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:52,798 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-07 21:29:52,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:52,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:52,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:52,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:52,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:52,799 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-07 21:29:52,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:52,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:52,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:52,897 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-07 21:29:52,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:52,910 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-07 21:29:52,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:53,395 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-07 21:29:53,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:54,161 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-07 21:29:54,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:54,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2019-01-07 21:29:54,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:54,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-07 21:29:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-07 21:29:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3139, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:29:54,181 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2019-01-07 21:29:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:55,327 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-07 21:29:55,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-07 21:29:55,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2019-01-07 21:29:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:55,328 INFO L225 Difference]: With dead ends: 126 [2019-01-07 21:29:55,328 INFO L226 Difference]: Without dead ends: 125 [2019-01-07 21:29:55,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3712, Invalid=5600, Unknown=0, NotChecked=0, Total=9312 [2019-01-07 21:29:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-07 21:29:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-01-07 21:29:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-07 21:29:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-07 21:29:55,343 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2019-01-07 21:29:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:55,343 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-07 21:29:55,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-07 21:29:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-07 21:29:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-07 21:29:55,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:55,344 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2019-01-07 21:29:55,344 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2019-01-07 21:29:55,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:55,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:55,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:55,909 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-07 21:29:55,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:55,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:55,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:55,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:55,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:55,910 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-07 21:29:55,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:55,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:56,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-07 21:29:56,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:56,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:56,077 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-07 21:29:56,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:56,087 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-07 21:29:56,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:56,622 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-07 21:29:56,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:57,630 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-07 21:29:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 76 [2019-01-07 21:29:57,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:57,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-07 21:29:57,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-07 21:29:57,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2457, Invalid=3395, Unknown=0, NotChecked=0, Total=5852 [2019-01-07 21:29:57,650 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2019-01-07 21:29:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:58,557 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-07 21:29:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-07 21:29:58,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2019-01-07 21:29:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:58,559 INFO L225 Difference]: With dead ends: 131 [2019-01-07 21:29:58,559 INFO L226 Difference]: Without dead ends: 130 [2019-01-07 21:29:58,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4029, Invalid=6071, Unknown=0, NotChecked=0, Total=10100 [2019-01-07 21:29:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-07 21:29:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-01-07 21:29:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-07 21:29:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-01-07 21:29:58,576 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2019-01-07 21:29:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:58,577 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-01-07 21:29:58,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-07 21:29:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-01-07 21:29:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-07 21:29:58,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:58,577 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2019-01-07 21:29:58,578 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2019-01-07 21:29:58,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:58,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:58,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:59,160 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-07 21:29:59,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:59,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:59,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:59,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:59,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:59,160 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-07 21:29:59,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:59,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:59,256 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:59,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:59,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:59,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-07 21:29:59,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:59,277 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-07 21:29:59,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:59,953 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-07 21:29:59,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:00,931 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-07 21:30:00,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:00,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2019-01-07 21:30:00,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:00,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-07 21:30:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-07 21:30:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2659, Invalid=3661, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:30:00,951 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2019-01-07 21:30:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:01,998 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-07 21:30:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-07 21:30:01,998 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2019-01-07 21:30:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:02,000 INFO L225 Difference]: With dead ends: 136 [2019-01-07 21:30:02,000 INFO L226 Difference]: Without dead ends: 135 [2019-01-07 21:30:02,001 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-07 21:30:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-07 21:30:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-01-07 21:30:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-07 21:30:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-07 21:30:02,022 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2019-01-07 21:30:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:02,022 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-07 21:30:02,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-07 21:30:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-07 21:30:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-07 21:30:02,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:02,023 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2019-01-07 21:30:02,023 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2019-01-07 21:30:02,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:02,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:02,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:02,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:02,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:02,607 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-07 21:30:02,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:02,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:02,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:02,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:02,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:02,608 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-07 21:30:02,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:02,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:02,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:02,727 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-07 21:30:02,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:02,758 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-07 21:30:02,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:03,318 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-07 21:30:03,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:04,432 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-07 21:30:04,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:04,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2019-01-07 21:30:04,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:04,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-07 21:30:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-07 21:30:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3937, Unknown=0, NotChecked=0, Total=6806 [2019-01-07 21:30:04,453 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2019-01-07 21:30:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:05,655 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-01-07 21:30:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-07 21:30:05,655 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2019-01-07 21:30:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:05,656 INFO L225 Difference]: With dead ends: 141 [2019-01-07 21:30:05,657 INFO L226 Difference]: Without dead ends: 140 [2019-01-07 21:30:05,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4702, Invalid=7070, Unknown=0, NotChecked=0, Total=11772 [2019-01-07 21:30:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-07 21:30:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-01-07 21:30:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-07 21:30:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-07 21:30:05,681 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2019-01-07 21:30:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:05,681 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-07 21:30:05,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-07 21:30:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-07 21:30:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-07 21:30:05,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:05,682 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2019-01-07 21:30:05,683 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2019-01-07 21:30:05,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:05,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:05,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:06,921 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-07 21:30:06,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:06,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:06,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:06,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:06,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:06,922 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-07 21:30:06,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:06,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:07,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-07 21:30:07,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:07,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:07,121 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-07 21:30:07,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:07,216 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-07 21:30:07,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:08,802 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-07 21:30:08,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:10,143 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-07 21:30:10,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:10,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2019-01-07 21:30:10,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:10,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-07 21:30:10,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-07 21:30:10,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3087, Invalid=4223, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:30:10,163 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2019-01-07 21:30:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:11,354 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-01-07 21:30:11,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-07 21:30:11,354 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-01-07 21:30:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:11,355 INFO L225 Difference]: With dead ends: 146 [2019-01-07 21:30:11,355 INFO L226 Difference]: Without dead ends: 145 [2019-01-07 21:30:11,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5058, Invalid=7598, Unknown=0, NotChecked=0, Total=12656 [2019-01-07 21:30:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-07 21:30:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-01-07 21:30:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-07 21:30:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-01-07 21:30:11,377 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2019-01-07 21:30:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:11,377 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-01-07 21:30:11,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-07 21:30:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-01-07 21:30:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-07 21:30:11,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:11,378 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2019-01-07 21:30:11,379 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2019-01-07 21:30:11,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:11,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:11,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:12,007 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-07 21:30:12,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:12,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:12,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:12,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:12,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:12,008 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-07 21:30:12,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:12,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:12,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:12,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:12,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:12,137 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-07 21:30:12,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:12,147 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-07 21:30:12,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:12,822 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-07 21:30:12,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:13,994 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-07 21:30:14,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:14,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2019-01-07 21:30:14,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:14,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-07 21:30:14,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-07 21:30:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3313, Invalid=4519, Unknown=0, NotChecked=0, Total=7832 [2019-01-07 21:30:14,015 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2019-01-07 21:30:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:15,375 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-07 21:30:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-07 21:30:15,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2019-01-07 21:30:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:15,376 INFO L225 Difference]: With dead ends: 151 [2019-01-07 21:30:15,376 INFO L226 Difference]: Without dead ends: 150 [2019-01-07 21:30:15,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4056 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5427, Invalid=8145, Unknown=0, NotChecked=0, Total=13572 [2019-01-07 21:30:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-07 21:30:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-01-07 21:30:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-07 21:30:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-01-07 21:30:15,396 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2019-01-07 21:30:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:15,396 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-01-07 21:30:15,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-07 21:30:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-01-07 21:30:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-07 21:30:15,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:15,397 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2019-01-07 21:30:15,397 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2019-01-07 21:30:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:15,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:15,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:16,647 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-07 21:30:16,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:16,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:16,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:16,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:16,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:16,648 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-07 21:30:16,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:16,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:16,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:16,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-07 21:30:16,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:16,779 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-07 21:30:16,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:17,418 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-07 21:30:17,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:18,844 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-07 21:30:18,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:18,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2019-01-07 21:30:18,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:18,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-07 21:30:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-07 21:30:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3547, Invalid=4825, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:30:18,864 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2019-01-07 21:30:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:20,083 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-01-07 21:30:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-07 21:30:20,083 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2019-01-07 21:30:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:20,084 INFO L225 Difference]: With dead ends: 156 [2019-01-07 21:30:20,084 INFO L226 Difference]: Without dead ends: 155 [2019-01-07 21:30:20,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5809, Invalid=8711, Unknown=0, NotChecked=0, Total=14520 [2019-01-07 21:30:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-07 21:30:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-01-07 21:30:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-07 21:30:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-01-07 21:30:20,108 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2019-01-07 21:30:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:20,108 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-01-07 21:30:20,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-07 21:30:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-01-07 21:30:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-07 21:30:20,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:20,109 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2019-01-07 21:30:20,109 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:20,110 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2019-01-07 21:30:20,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:20,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:20,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:20,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:20,959 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-07 21:30:20,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:20,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:20,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:20,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:20,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:20,960 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-07 21:30:20,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:20,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:21,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-07 21:30:21,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:21,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:21,144 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-07 21:30:21,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:21,172 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-07 21:30:21,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:22,431 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-07 21:30:22,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:23,838 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-07 21:30:23,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2019-01-07 21:30:23,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:23,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-07 21:30:23,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-07 21:30:23,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3789, Invalid=5141, Unknown=0, NotChecked=0, Total=8930 [2019-01-07 21:30:23,859 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2019-01-07 21:30:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:25,090 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-01-07 21:30:25,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-07 21:30:25,091 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2019-01-07 21:30:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:25,092 INFO L225 Difference]: With dead ends: 161 [2019-01-07 21:30:25,092 INFO L226 Difference]: Without dead ends: 160 [2019-01-07 21:30:25,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4646 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6204, Invalid=9296, Unknown=0, NotChecked=0, Total=15500 [2019-01-07 21:30:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-07 21:30:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-01-07 21:30:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-07 21:30:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-07 21:30:25,118 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2019-01-07 21:30:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:25,118 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-07 21:30:25,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-07 21:30:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-07 21:30:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-07 21:30:25,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:25,119 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2019-01-07 21:30:25,120 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2019-01-07 21:30:25,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:25,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:25,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:25,957 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-07 21:30:25,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:25,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:25,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:25,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:25,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:25,958 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-07 21:30:25,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:25,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:26,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:26,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:26,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:26,083 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-07 21:30:26,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:26,094 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-07 21:30:26,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:26,866 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-07 21:30:26,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:28,343 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-07 21:30:28,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:28,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 97 [2019-01-07 21:30:28,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:28,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-07 21:30:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-07 21:30:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4039, Invalid=5467, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:30:28,364 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2019-01-07 21:30:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:29,745 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-01-07 21:30:29,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-07 21:30:29,745 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2019-01-07 21:30:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:29,746 INFO L225 Difference]: With dead ends: 166 [2019-01-07 21:30:29,746 INFO L226 Difference]: Without dead ends: 165 [2019-01-07 21:30:29,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6612, Invalid=9900, Unknown=0, NotChecked=0, Total=16512 [2019-01-07 21:30:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-07 21:30:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-01-07 21:30:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-07 21:30:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-01-07 21:30:29,780 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2019-01-07 21:30:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:29,781 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-01-07 21:30:29,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-07 21:30:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-01-07 21:30:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-07 21:30:29,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:29,782 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2019-01-07 21:30:29,782 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2019-01-07 21:30:29,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:29,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:29,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:29,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:29,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:30,892 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-07 21:30:30,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:30,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:30,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30: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-07 21:30:30,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30: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 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-07 21:30:30,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:30,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:31,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:31,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-07 21:30:31,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:31,033 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-07 21:30:31,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:31,851 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-07 21:30:31,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:33,411 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-07 21:30:33,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:33,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 100 [2019-01-07 21:30:33,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:33,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-07 21:30:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-07 21:30:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4297, Invalid=5803, Unknown=0, NotChecked=0, Total=10100 [2019-01-07 21:30:33,434 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2019-01-07 21:30:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:34,874 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-07 21:30:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-07 21:30:34,874 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2019-01-07 21:30:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:34,875 INFO L225 Difference]: With dead ends: 171 [2019-01-07 21:30:34,875 INFO L226 Difference]: Without dead ends: 170 [2019-01-07 21:30:34,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5276 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7033, Invalid=10523, Unknown=0, NotChecked=0, Total=17556 [2019-01-07 21:30:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-07 21:30:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-01-07 21:30:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-07 21:30:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-01-07 21:30:34,906 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2019-01-07 21:30:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:34,906 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-01-07 21:30:34,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-07 21:30:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-01-07 21:30:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-07 21:30:34,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:34,907 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2019-01-07 21:30:34,907 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:34,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2019-01-07 21:30:34,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:34,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:34,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:36,034 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-07 21:30:36,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:36,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:36,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:36,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:36,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:36,035 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-07 21:30:36,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:36,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:36,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-07 21:30:36,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:36,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:36,257 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-07 21:30:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:36,269 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-07 21:30:36,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:37,112 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-07 21:30:37,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:38,703 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-07 21:30:38,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:38,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2019-01-07 21:30:38,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:38,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-07 21:30:38,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-07 21:30:38,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=6149, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 21:30:38,725 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2019-01-07 21:30:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:40,465 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-01-07 21:30:40,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-07 21:30:40,466 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-01-07 21:30:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:40,467 INFO L225 Difference]: With dead ends: 176 [2019-01-07 21:30:40,467 INFO L226 Difference]: Without dead ends: 175 [2019-01-07 21:30:40,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5606 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7467, Invalid=11165, Unknown=0, NotChecked=0, Total=18632 [2019-01-07 21:30:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-07 21:30:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-01-07 21:30:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-07 21:30:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-01-07 21:30:40,506 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2019-01-07 21:30:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:40,506 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-01-07 21:30:40,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-07 21:30:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-01-07 21:30:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-07 21:30:40,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:40,508 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2019-01-07 21:30:40,508 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2019-01-07 21:30:40,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:40,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:40,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:40,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:40,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:41,718 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-07 21:30:41,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:41,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:41,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:41,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:41,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:41,719 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-07 21:30:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:41,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:41,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:41,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:41,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:41,856 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-07 21:30:41,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:41,864 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-07 21:30:41,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:42,831 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-07 21:30:42,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:44,527 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-07 21:30:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:44,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 106 [2019-01-07 21:30:44,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:44,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-07 21:30:44,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-07 21:30:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=6505, Unknown=0, NotChecked=0, Total=11342 [2019-01-07 21:30:44,550 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2019-01-07 21:30:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:46,254 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-01-07 21:30:46,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-07 21:30:46,255 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2019-01-07 21:30:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:46,256 INFO L225 Difference]: With dead ends: 181 [2019-01-07 21:30:46,256 INFO L226 Difference]: Without dead ends: 180 [2019-01-07 21:30:46,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5946 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7914, Invalid=11826, Unknown=0, NotChecked=0, Total=19740 [2019-01-07 21:30:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-07 21:30:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-01-07 21:30:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-07 21:30:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-07 21:30:46,296 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2019-01-07 21:30:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:46,297 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-07 21:30:46,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-07 21:30:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-07 21:30:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-07 21:30:46,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:46,298 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2019-01-07 21:30:46,299 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2019-01-07 21:30:46,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:46,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:46,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:47,951 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-07 21:30:47,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:47,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:47,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:47,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:47,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:47,952 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-07 21:30:47,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:47,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:48,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:48,092 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-07 21:30:48,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:48,167 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-07 21:30:48,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:49,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-07 21:30:49,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:51,071 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-07 21:30:51,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:51,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2019-01-07 21:30:51,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:51,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-07 21:30:51,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-07 21:30:51,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5119, Invalid=6871, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 21:30:51,092 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2019-01-07 21:30:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:53,043 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-01-07 21:30:53,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-07 21:30:53,044 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2019-01-07 21:30:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:53,045 INFO L225 Difference]: With dead ends: 186 [2019-01-07 21:30:53,045 INFO L226 Difference]: Without dead ends: 185 [2019-01-07 21:30:53,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6296 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8374, Invalid=12506, Unknown=0, NotChecked=0, Total=20880 [2019-01-07 21:30:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-07 21:30:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-01-07 21:30:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-07 21:30:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-01-07 21:30:53,081 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2019-01-07 21:30:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:53,082 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-01-07 21:30:53,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-07 21:30:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-01-07 21:30:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-07 21:30:53,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:53,083 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2019-01-07 21:30:53,083 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2019-01-07 21:30:53,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:53,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:53,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:54,002 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-07 21:30:54,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:54,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:54,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:54,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:54,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:54,003 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-07 21:30:54,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:54,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:54,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-07 21:30:54,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:54,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:54,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-07 21:30:54,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:54,330 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-07 21:30:54,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:55,459 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-07 21:30:55,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:57,595 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-07 21:30:57,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 112 [2019-01-07 21:30:57,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:57,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-07 21:30:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-07 21:30:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5409, Invalid=7247, Unknown=0, NotChecked=0, Total=12656 [2019-01-07 21:30:57,618 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2019-01-07 21:30:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:59,292 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-07 21:30:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-07 21:30:59,293 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2019-01-07 21:30:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:59,294 INFO L225 Difference]: With dead ends: 191 [2019-01-07 21:30:59,294 INFO L226 Difference]: Without dead ends: 190 [2019-01-07 21:30:59,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8847, Invalid=13205, Unknown=0, NotChecked=0, Total=22052 [2019-01-07 21:30:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-07 21:30:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-01-07 21:30:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-07 21:30:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-01-07 21:30:59,326 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2019-01-07 21:30:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:59,327 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-01-07 21:30:59,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-07 21:30:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-01-07 21:30:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-07 21:30:59,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:59,328 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2019-01-07 21:30:59,328 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2019-01-07 21:30:59,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:59,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:59,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:59,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:59,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:00,273 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-07 21:31:00,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:00,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:00,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:00,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:00,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:00,273 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-07 21:31:00,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:31:00,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:31:00,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:31:00,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:00,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:00,449 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-07 21:31:00,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:00,479 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-07 21:31:00,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:02,269 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-07 21:31:02,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:04,401 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-07 21:31:04,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 115 [2019-01-07 21:31:04,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:04,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-07 21:31:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-07 21:31:04,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5707, Invalid=7633, Unknown=0, NotChecked=0, Total=13340 [2019-01-07 21:31:04,424 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2019-01-07 21:31:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:06,218 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-01-07 21:31:06,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-07 21:31:06,219 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2019-01-07 21:31:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:06,220 INFO L225 Difference]: With dead ends: 196 [2019-01-07 21:31:06,220 INFO L226 Difference]: Without dead ends: 195 [2019-01-07 21:31:06,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9333, Invalid=13923, Unknown=0, NotChecked=0, Total=23256 [2019-01-07 21:31:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-07 21:31:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-01-07 21:31:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-07 21:31:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-01-07 21:31:06,263 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2019-01-07 21:31:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:06,263 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-01-07 21:31:06,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-07 21:31:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-01-07 21:31:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-07 21:31:06,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:06,264 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2019-01-07 21:31:06,264 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2019-01-07 21:31:06,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:06,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:06,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:07,341 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-07 21:31:07,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:07,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:07,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:07,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:07,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:07,342 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-07 21:31:07,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:07,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:31:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:07,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:07,508 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-07 21:31:07,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:07,519 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-07 21:31:07,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:08,695 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-07 21:31:08,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:10,712 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-07 21:31:10,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:10,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2019-01-07 21:31:10,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:10,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-07 21:31:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-07 21:31:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6013, Invalid=8029, Unknown=0, NotChecked=0, Total=14042 [2019-01-07 21:31:10,735 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2019-01-07 21:31:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:12,705 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-01-07 21:31:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-07 21:31:12,705 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2019-01-07 21:31:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:12,706 INFO L225 Difference]: With dead ends: 201 [2019-01-07 21:31:12,706 INFO L226 Difference]: Without dead ends: 200 [2019-01-07 21:31:12,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9832, Invalid=14660, Unknown=0, NotChecked=0, Total=24492 [2019-01-07 21:31:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-07 21:31:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-01-07 21:31:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-07 21:31:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-07 21:31:12,756 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2019-01-07 21:31:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:12,756 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-07 21:31:12,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-07 21:31:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-07 21:31:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-07 21:31:12,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:12,758 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2019-01-07 21:31:12,758 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:12,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:12,758 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2019-01-07 21:31:12,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:12,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:12,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:12,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:12,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:14,407 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-07 21:31:14,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:14,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:14,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:14,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:14,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:14,408 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-07 21:31:14,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:31:14,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:31:14,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-07 21:31:14,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:14,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:14,689 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-07 21:31:14,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:14,705 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-07 21:31:14,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:15,791 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-07 21:31:15,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:18,194 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-07 21:31:18,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:18,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 121 [2019-01-07 21:31:18,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:18,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-07 21:31:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-07 21:31:18,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6327, Invalid=8435, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 21:31:18,216 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2019-01-07 21:31:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:20,083 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-01-07 21:31:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-07 21:31:20,083 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2019-01-07 21:31:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:20,084 INFO L225 Difference]: With dead ends: 206 [2019-01-07 21:31:20,084 INFO L226 Difference]: Without dead ends: 205 [2019-01-07 21:31:20,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7796 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10344, Invalid=15416, Unknown=0, NotChecked=0, Total=25760 [2019-01-07 21:31:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-07 21:31:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-01-07 21:31:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-07 21:31:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-01-07 21:31:20,119 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2019-01-07 21:31:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:20,119 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-01-07 21:31:20,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-07 21:31:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-01-07 21:31:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-07 21:31:20,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:20,120 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2019-01-07 21:31:20,120 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2019-01-07 21:31:20,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:20,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:20,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:20,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:20,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:21,321 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-07 21:31:21,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:21,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:21,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:21,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:21,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:21,322 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-07 21:31:21,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:31:21,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:31:21,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:31:21,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:21,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:21,483 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-07 21:31:21,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:21,503 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-07 21:31:21,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:22,901 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-07 21:31:22,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:25,879 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-07 21:31:25,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:25,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 124 [2019-01-07 21:31:25,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:25,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-07 21:31:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-07 21:31:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6649, Invalid=8851, Unknown=0, NotChecked=0, Total=15500 [2019-01-07 21:31:25,900 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2019-01-07 21:31:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:28,136 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-07 21:31:28,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-07 21:31:28,136 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2019-01-07 21:31:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:28,137 INFO L225 Difference]: With dead ends: 211 [2019-01-07 21:31:28,137 INFO L226 Difference]: Without dead ends: 210 [2019-01-07 21:31:28,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10869, Invalid=16191, Unknown=0, NotChecked=0, Total=27060 [2019-01-07 21:31:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-07 21:31:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-01-07 21:31:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-07 21:31:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-01-07 21:31:28,189 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2019-01-07 21:31:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:28,189 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-01-07 21:31:28,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-07 21:31:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-01-07 21:31:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-07 21:31:28,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:28,190 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2019-01-07 21:31:28,190 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2019-01-07 21:31:28,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:28,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:28,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:28,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:28,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:29,210 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-07 21:31:29,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:29,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:29,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:29,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:29,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:29,211 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-07 21:31:29,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:29,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:31:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:29,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:29,394 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-07 21:31:29,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:29,486 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-07 21:31:29,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:30,758 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-07 21:31:30,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:33,402 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-07 21:31:33,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:33,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 127 [2019-01-07 21:31:33,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:33,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-07 21:31:33,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-07 21:31:33,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6979, Invalid=9277, Unknown=0, NotChecked=0, Total=16256 [2019-01-07 21:31:33,424 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2019-01-07 21:31:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:35,480 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-01-07 21:31:35,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-07 21:31:35,480 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2019-01-07 21:31:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:35,481 INFO L225 Difference]: With dead ends: 216 [2019-01-07 21:31:35,481 INFO L226 Difference]: Without dead ends: 215 [2019-01-07 21:31:35,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8606 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=11407, Invalid=16985, Unknown=0, NotChecked=0, Total=28392 [2019-01-07 21:31:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-07 21:31:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-01-07 21:31:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-07 21:31:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-01-07 21:31:35,526 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2019-01-07 21:31:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:35,526 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-01-07 21:31:35,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-07 21:31:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-01-07 21:31:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-01-07 21:31:35,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:35,527 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2019-01-07 21:31:35,527 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:35,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2019-01-07 21:31:35,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:35,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:35,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:35,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:37,541 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-07 21:31:37,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:37,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:37,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:37,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:37,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:37,542 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-07 21:31:37,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:31:37,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:31:37,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-07 21:31:37,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:37,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:37,879 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-07 21:31:37,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:37,913 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-07 21:31:37,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:39,138 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-07 21:31:39,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:41,647 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-07 21:31:41,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:41,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 130 [2019-01-07 21:31:41,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:41,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-07 21:31:41,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-07 21:31:41,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7317, Invalid=9713, Unknown=0, NotChecked=0, Total=17030 [2019-01-07 21:31:41,669 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2019-01-07 21:31:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:43,851 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-01-07 21:31:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-07 21:31:43,851 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2019-01-07 21:31:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:43,852 INFO L225 Difference]: With dead ends: 221 [2019-01-07 21:31:43,853 INFO L226 Difference]: Without dead ends: 220 [2019-01-07 21:31:43,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9026 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11958, Invalid=17798, Unknown=0, NotChecked=0, Total=29756 [2019-01-07 21:31:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-07 21:31:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-01-07 21:31:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-07 21:31:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-07 21:31:43,897 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2019-01-07 21:31:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:43,897 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-07 21:31:43,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-07 21:31:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-07 21:31:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-07 21:31:43,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:43,898 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2019-01-07 21:31:43,899 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2019-01-07 21:31:43,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:43,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:43,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:43,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:43,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:45,138 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-07 21:31:45,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:45,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:45,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:45,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:45,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:45,139 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-07 21:31:45,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:31:45,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:31:45,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:31:45,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:45,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:45,304 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-07 21:31:45,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:45,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-07 21:31:45,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:46,670 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-07 21:31:46,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:49,814 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-07 21:31:49,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:49,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 133 [2019-01-07 21:31:49,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:49,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-07 21:31:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-07 21:31:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=10159, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:31:49,836 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2019-01-07 21:31:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:52,040 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-01-07 21:31:52,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-07 21:31:52,041 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2019-01-07 21:31:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:52,042 INFO L225 Difference]: With dead ends: 226 [2019-01-07 21:31:52,042 INFO L226 Difference]: Without dead ends: 225 [2019-01-07 21:31:52,043 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-07 21:31:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-07 21:31:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-01-07 21:31:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-07 21:31:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-01-07 21:31:52,085 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2019-01-07 21:31:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:52,085 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-01-07 21:31:52,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-07 21:31:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-01-07 21:31:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-07 21:31:52,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:52,087 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2019-01-07 21:31:52,087 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2019-01-07 21:31:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:52,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:52,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:53,687 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-07 21:31:53,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:53,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:53,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:53,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:53,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:53,688 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-07 21:31:53,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:53,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:31:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:53,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:53,857 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-07 21:31:53,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:53,870 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-07 21:31:53,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:55,206 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-07 21:31:55,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:58,203 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-07 21:31:58,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:58,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 136 [2019-01-07 21:31:58,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:58,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-07 21:31:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-07 21:31:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8017, Invalid=10615, Unknown=0, NotChecked=0, Total=18632 [2019-01-07 21:31:58,226 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2019-01-07 21:32:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:00,664 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-07 21:32:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-07 21:32:00,665 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2019-01-07 21:32:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:00,666 INFO L225 Difference]: With dead ends: 231 [2019-01-07 21:32:00,666 INFO L226 Difference]: Without dead ends: 230 [2019-01-07 21:32:00,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9896 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13099, Invalid=19481, Unknown=0, NotChecked=0, Total=32580 [2019-01-07 21:32:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-07 21:32:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-07 21:32:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-07 21:32:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-01-07 21:32:00,728 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2019-01-07 21:32:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:00,728 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-01-07 21:32:00,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-07 21:32:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-01-07 21:32:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-07 21:32:00,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:00,730 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2019-01-07 21:32:00,730 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2019-01-07 21:32:00,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:00,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:00,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:02,291 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-07 21:32:02,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:02,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:02,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:02,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:02,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:02,292 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-07 21:32:02,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:32:02,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:32:02,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-07 21:32:02,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:02,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:02,632 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-07 21:32:02,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:02,640 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-07 21:32:02,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:04,210 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-07 21:32:04,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:07,130 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-07 21:32:07,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:07,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 139 [2019-01-07 21:32:07,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:07,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-07 21:32:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-07 21:32:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8379, Invalid=11081, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 21:32:07,153 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2019-01-07 21:32:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:09,759 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-01-07 21:32:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-07 21:32:09,759 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2019-01-07 21:32:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:09,760 INFO L225 Difference]: With dead ends: 236 [2019-01-07 21:32:09,761 INFO L226 Difference]: Without dead ends: 235 [2019-01-07 21:32:09,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10346 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=13689, Invalid=20351, Unknown=0, NotChecked=0, Total=34040 [2019-01-07 21:32:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-07 21:32:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-01-07 21:32:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-07 21:32:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-01-07 21:32:09,817 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2019-01-07 21:32:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:09,818 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-01-07 21:32:09,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-07 21:32:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-01-07 21:32:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-07 21:32:09,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:09,819 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2019-01-07 21:32:09,819 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2019-01-07 21:32:09,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:09,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:09,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:11,261 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-07 21:32:11,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:11,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:11,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:11,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:11,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:11,262 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-07 21:32:11,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:32:11,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:32:11,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:32:11,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:11,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:11,460 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-07 21:32:11,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:11,472 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-07 21:32:11,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:13,138 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-07 21:32:13,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:16,215 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-07 21:32:16,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:16,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 142 [2019-01-07 21:32:16,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:16,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-07 21:32:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-07 21:32:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8749, Invalid=11557, Unknown=0, NotChecked=0, Total=20306 [2019-01-07 21:32:16,238 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2019-01-07 21:32:18,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:18,988 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-01-07 21:32:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-07 21:32:18,988 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-01-07 21:32:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:18,990 INFO L225 Difference]: With dead ends: 241 [2019-01-07 21:32:18,990 INFO L226 Difference]: Without dead ends: 240 [2019-01-07 21:32:18,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10806 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=14292, Invalid=21240, Unknown=0, NotChecked=0, Total=35532 [2019-01-07 21:32:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-07 21:32:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2019-01-07 21:32:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-07 21:32:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-07 21:32:19,052 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2019-01-07 21:32:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:19,053 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-07 21:32:19,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-07 21:32:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-07 21:32:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-07 21:32:19,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:19,054 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2019-01-07 21:32:19,055 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2019-01-07 21:32:19,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:19,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:19,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:20,600 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-07 21:32:20,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:20,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:20,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:20,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:20,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:20,601 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-07 21:32:20,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:20,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:32:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:20,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:20,776 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-07 21:32:20,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:20,782 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-07 21:32:20,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:22,344 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-07 21:32:22,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:25,755 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-07 21:32:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 145 [2019-01-07 21:32:25,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:25,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-07 21:32:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-07 21:32:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=12043, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 21:32:25,776 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2019-01-07 21:32:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:28,398 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-01-07 21:32:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-07 21:32:28,398 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2019-01-07 21:32:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:28,399 INFO L225 Difference]: With dead ends: 246 [2019-01-07 21:32:28,399 INFO L226 Difference]: Without dead ends: 245 [2019-01-07 21:32:28,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11276 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14908, Invalid=22148, Unknown=0, NotChecked=0, Total=37056 [2019-01-07 21:32:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-07 21:32:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-01-07 21:32:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-07 21:32:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-01-07 21:32:28,453 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2019-01-07 21:32:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:28,453 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-01-07 21:32:28,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-07 21:32:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-01-07 21:32:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-07 21:32:28,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:28,454 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2019-01-07 21:32:28,454 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:28,455 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2019-01-07 21:32:28,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:28,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:28,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:28,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:28,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:29,840 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-07 21:32:29,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:29,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:29,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:29,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:29,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:29,841 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-07 21:32:29,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:32:29,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:32:30,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-07 21:32:30,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:30,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:30,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:32:30,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32: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-07 21:32:30,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:31,778 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-07 21:32:31,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:35,289 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-07 21:32:35,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:35,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 148 [2019-01-07 21:32:35,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:35,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-07 21:32:35,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-07 21:32:35,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9513, Invalid=12539, Unknown=0, NotChecked=0, Total=22052 [2019-01-07 21:32:35,312 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2019-01-07 21:32:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:37,854 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-07 21:32:37,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-07 21:32:37,854 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2019-01-07 21:32:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:37,855 INFO L225 Difference]: With dead ends: 251 [2019-01-07 21:32:37,855 INFO L226 Difference]: Without dead ends: 250 [2019-01-07 21:32:37,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11756 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=15537, Invalid=23075, Unknown=0, NotChecked=0, Total=38612 [2019-01-07 21:32:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-07 21:32:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-01-07 21:32:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-07 21:32:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-01-07 21:32:37,913 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2019-01-07 21:32:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:37,913 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-01-07 21:32:37,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-07 21:32:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-01-07 21:32:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-07 21:32:37,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:37,914 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2019-01-07 21:32:37,915 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2019-01-07 21:32:37,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:37,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:37,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:37,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:37,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:39,668 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-07 21:32:39,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:39,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:39,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:39,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:39,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:39,669 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-07 21:32:39,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:32:39,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:32:39,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:32:39,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:39,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:39,870 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-07 21:32:39,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:39,879 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-07 21:32:39,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:41,583 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-07 21:32:41,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:45,170 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-07 21:32:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:45,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-07 21:32:45,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:45,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-07 21:32:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-07 21:32:45,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9907, Invalid=13045, Unknown=0, NotChecked=0, Total=22952 [2019-01-07 21:32:45,192 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2019-01-07 21:32:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:47,826 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2019-01-07 21:32:47,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-07 21:32:47,826 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2019-01-07 21:32:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:47,828 INFO L225 Difference]: With dead ends: 256 [2019-01-07 21:32:47,828 INFO L226 Difference]: Without dead ends: 255 [2019-01-07 21:32:47,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12246 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=16179, Invalid=24021, Unknown=0, NotChecked=0, Total=40200 [2019-01-07 21:32:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-07 21:32:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-01-07 21:32:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-07 21:32:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-01-07 21:32:47,917 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2019-01-07 21:32:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:47,917 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-01-07 21:32:47,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-07 21:32:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-01-07 21:32:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-01-07 21:32:47,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:47,919 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2019-01-07 21:32:47,919 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2019-01-07 21:32:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:47,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:47,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:49,707 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-07 21:32:49,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:49,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:49,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:49,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:49,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:49,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 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-07 21:32:49,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:49,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:32:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:49,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:49,891 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-07 21:32:49,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:49,900 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-07 21:32:49,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:51,602 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-07 21:32:51,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:55,442 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-07 21:32:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:55,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-07 21:32:55,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:55,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-07 21:32:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-07 21:32:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10309, Invalid=13561, Unknown=0, NotChecked=0, Total=23870 [2019-01-07 21:32:55,465 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2019-01-07 21:32:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:58,220 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-01-07 21:32:58,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-07 21:32:58,220 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2019-01-07 21:32:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:58,221 INFO L225 Difference]: With dead ends: 261 [2019-01-07 21:32:58,221 INFO L226 Difference]: Without dead ends: 260 [2019-01-07 21:32:58,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12746 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=16834, Invalid=24986, Unknown=0, NotChecked=0, Total=41820 [2019-01-07 21:32:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-07 21:32:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2019-01-07 21:32:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-07 21:32:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-07 21:32:58,294 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2019-01-07 21:32:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:58,295 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-07 21:32:58,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-07 21:32:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-07 21:32:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-07 21:32:58,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:58,297 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2019-01-07 21:32:58,297 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:58,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2019-01-07 21:32:58,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:58,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:58,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:00,107 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-07 21:33:00,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:00,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:00,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:00,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:00,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:00,108 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-07 21:33:00,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:33:00,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:33:00,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-07 21:33:00,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:00,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:00,493 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-07 21:33:00,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:00,501 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-07 21:33:00,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:02,256 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-07 21:33:02,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:06,121 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-07 21:33:06,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:06,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-07 21:33:06,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:06,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-07 21:33:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-07 21:33:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10412, Invalid=13768, Unknown=0, NotChecked=0, Total=24180 [2019-01-07 21:33:06,144 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2019-01-07 21:33:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:09,207 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-01-07 21:33:09,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-07 21:33:09,207 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2019-01-07 21:33:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:09,208 INFO L225 Difference]: With dead ends: 266 [2019-01-07 21:33:09,208 INFO L226 Difference]: Without dead ends: 265 [2019-01-07 21:33:09,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13347 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17093, Invalid=25549, Unknown=0, NotChecked=0, Total=42642 [2019-01-07 21:33:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-07 21:33:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-01-07 21:33:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-07 21:33:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-01-07 21:33:09,267 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2019-01-07 21:33:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:09,267 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-01-07 21:33:09,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-07 21:33:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-01-07 21:33:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-07 21:33:09,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:09,269 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2019-01-07 21:33:09,269 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2019-01-07 21:33:09,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:09,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:09,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:10,839 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-07 21:33:10,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:10,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:10,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:10,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:10,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:10,840 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-07 21:33:10,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:33:10,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:33:11,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:33:11,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:11,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:11,039 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-07 21:33:11,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:11,047 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-07 21:33:11,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:12,854 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-07 21:33:12,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:16,690 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-07 21:33:16,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:16,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-07 21:33:16,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:16,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-07 21:33:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-07 21:33:16,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10515, Invalid=13977, Unknown=0, NotChecked=0, Total=24492 [2019-01-07 21:33:16,712 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2019-01-07 21:33:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:19,906 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-07 21:33:19,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-07 21:33:19,906 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2019-01-07 21:33:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:19,907 INFO L225 Difference]: With dead ends: 271 [2019-01-07 21:33:19,907 INFO L226 Difference]: Without dead ends: 270 [2019-01-07 21:33:19,909 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-07 21:33:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-07 21:33:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-01-07 21:33:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-07 21:33:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-01-07 21:33:20,001 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2019-01-07 21:33:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:20,002 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-01-07 21:33:20,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-07 21:33:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-01-07 21:33:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-07 21:33:20,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:20,003 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2019-01-07 21:33:20,003 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2019-01-07 21:33:20,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:20,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:20,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:20,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:20,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:21,772 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-07 21:33:21,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:21,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:21,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:21,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:21,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:21,773 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-07 21:33:21,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:21,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:21,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:21,967 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-07 21:33:21,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:21,976 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-07 21:33:21,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:23,853 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-07 21:33:23,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:27,690 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-07 21:33:27,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:27,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-07 21:33:27,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:27,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-07 21:33:27,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-07 21:33:27,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10618, Invalid=14188, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 21:33:27,712 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2019-01-07 21:33:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:30,898 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-01-07 21:33:30,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-07 21:33:30,898 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2019-01-07 21:33:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:30,900 INFO L225 Difference]: With dead ends: 276 [2019-01-07 21:33:30,900 INFO L226 Difference]: Without dead ends: 275 [2019-01-07 21:33:30,901 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-07 21:33:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-07 21:33:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-01-07 21:33:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-01-07 21:33:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-01-07 21:33:30,980 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2019-01-07 21:33:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:30,980 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-01-07 21:33:30,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-07 21:33:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-01-07 21:33:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-01-07 21:33:30,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:30,982 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2019-01-07 21:33:30,982 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2019-01-07 21:33:30,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:30,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:32,607 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-07 21:33:32,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:32,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:32,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:32,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:32,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:32,607 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-07 21:33:32,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:33:32,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:33:33,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-07 21:33:33,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:33,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:33,054 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-07 21:33:33,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:33,062 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-07 21:33:33,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:35,350 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-07 21:33:35,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:39,004 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-07 21:33:39,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:39,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-07 21:33:39,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:39,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-07 21:33:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-07 21:33:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10721, Invalid=14401, Unknown=0, NotChecked=0, Total=25122 [2019-01-07 21:33:39,026 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2019-01-07 21:33:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:42,384 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-01-07 21:33:42,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-07 21:33:42,385 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2019-01-07 21:33:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:42,386 INFO L225 Difference]: With dead ends: 281 [2019-01-07 21:33:42,386 INFO L226 Difference]: Without dead ends: 280 [2019-01-07 21:33:42,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 431 SyntacticMatches, 8 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15162 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=17876, Invalid=27280, Unknown=0, NotChecked=0, Total=45156 [2019-01-07 21:33:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-07 21:33:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2019-01-07 21:33:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-07 21:33:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-07 21:33:42,477 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2019-01-07 21:33:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:42,478 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-07 21:33:42,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-07 21:33:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-07 21:33:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-07 21:33:42,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:42,479 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2019-01-07 21:33:42,480 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2019-01-07 21:33:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:42,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:42,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:44,212 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-07 21:33:44,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:44,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:44,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:44,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:44,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:44,212 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-07 21:33:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:33:44,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:33:44,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:33:44,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:44,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:44,430 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-07 21:33:44,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:44,440 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-07 21:33:44,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:46,690 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-07 21:33:46,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:50,648 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-07 21:33:50,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:50,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-07 21:33:50,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:50,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-07 21:33:50,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-07 21:33:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10824, Invalid=14616, Unknown=0, NotChecked=0, Total=25440 [2019-01-07 21:33:50,670 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2019-01-07 21:33:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:53,985 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-01-07 21:33:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-07 21:33:53,985 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2019-01-07 21:33:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:53,986 INFO L225 Difference]: With dead ends: 286 [2019-01-07 21:33:53,987 INFO L226 Difference]: Without dead ends: 285 [2019-01-07 21:33:53,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 439 SyntacticMatches, 10 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15771 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18139, Invalid=27871, Unknown=0, NotChecked=0, Total=46010 [2019-01-07 21:33:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-07 21:33:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-01-07 21:33:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-07 21:33:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2019-01-07 21:33:54,054 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2019-01-07 21:33:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:54,054 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2019-01-07 21:33:54,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-07 21:33:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2019-01-07 21:33:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-07 21:33:54,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:54,055 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2019-01-07 21:33:54,055 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2019-01-07 21:33:54,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:54,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:54,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:56,142 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-07 21:33:56,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:56,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:56,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:56,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:56,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:56,143 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-07 21:33:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:56,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:56,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:56,348 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-07 21:33:56,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:56,357 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-07 21:33:56,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:58,587 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-07 21:33:58,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:02,740 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-07 21:34:02,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:02,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-07 21:34:02,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:02,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-07 21:34:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-07 21:34:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10927, Invalid=14833, Unknown=0, NotChecked=0, Total=25760 [2019-01-07 21:34:02,762 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2019-01-07 21:34:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:06,360 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-07 21:34:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-07 21:34:06,361 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2019-01-07 21:34:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:06,362 INFO L225 Difference]: With dead ends: 291 [2019-01-07 21:34:06,362 INFO L226 Difference]: Without dead ends: 290 [2019-01-07 21:34:06,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16382 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=18403, Invalid=28469, Unknown=0, NotChecked=0, Total=46872 [2019-01-07 21:34:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-07 21:34:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-01-07 21:34:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-07 21:34:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-01-07 21:34:06,431 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2019-01-07 21:34:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:06,431 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-01-07 21:34:06,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-07 21:34:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-01-07 21:34:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-07 21:34:06,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:06,432 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2019-01-07 21:34:06,432 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2019-01-07 21:34:06,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:06,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:06,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:06,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:06,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:08,251 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-07 21:34:08,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:08,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:08,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:08,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:08,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:08,252 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-07 21:34:08,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:08,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:08,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-07 21:34:08,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:08,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:08,770 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-07 21:34:08,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:08,779 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-07 21:34:08,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:11,030 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-07 21:34:11,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:14,793 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-07 21:34:14,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:14,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-07 21:34:14,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:14,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-07 21:34:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-07 21:34:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11030, Invalid=15052, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 21:34:14,816 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2019-01-07 21:34:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:18,503 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-01-07 21:34:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-07 21:34:18,504 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2019-01-07 21:34:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:18,505 INFO L225 Difference]: With dead ends: 296 [2019-01-07 21:34:18,505 INFO L226 Difference]: Without dead ends: 295 [2019-01-07 21:34:18,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 455 SyntacticMatches, 14 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16995 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=18668, Invalid=29074, Unknown=0, NotChecked=0, Total=47742 [2019-01-07 21:34:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-01-07 21:34:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-01-07 21:34:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-07 21:34:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-01-07 21:34:18,584 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2019-01-07 21:34:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:18,585 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-01-07 21:34:18,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-07 21:34:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-01-07 21:34:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-07 21:34:18,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:18,586 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2019-01-07 21:34:18,586 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2019-01-07 21:34:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:18,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:18,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:20,505 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-07 21:34:20,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:20,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:20,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:20,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:20,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:20,506 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-07 21:34:20,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:34:20,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:34:20,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:34:20,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:20,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:20,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:34:20,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:20,745 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-07 21:34:20,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:23,302 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-07 21:34:23,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:27,339 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-07 21:34:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:27,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-07 21:34:27,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:27,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-07 21:34:27,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-07 21:34:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11133, Invalid=15273, Unknown=0, NotChecked=0, Total=26406 [2019-01-07 21:34:27,362 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2019-01-07 21:34:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:30,820 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-01-07 21:34:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-07 21:34:30,821 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2019-01-07 21:34:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:30,822 INFO L225 Difference]: With dead ends: 301 [2019-01-07 21:34:30,822 INFO L226 Difference]: Without dead ends: 300 [2019-01-07 21:34:30,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 463 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17610 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=18934, Invalid=29686, Unknown=0, NotChecked=0, Total=48620 [2019-01-07 21:34:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-07 21:34:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-01-07 21:34:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-07 21:34:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-07 21:34:30,901 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2019-01-07 21:34:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:30,901 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-07 21:34:30,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-07 21:34:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-07 21:34:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-07 21:34:30,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:30,903 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2019-01-07 21:34:30,903 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2019-01-07 21:34:30,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:30,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:30,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:30,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:30,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:33,016 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-07 21:34:33,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:33,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:33,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:33,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:33,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:33,017 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-07 21:34:33,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:33,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:33,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:33,240 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-07 21:34:33,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:33,249 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-07 21:34:33,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:35,570 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-07 21:34:35,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:39,795 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-07 21:34:39,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:39,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-07 21:34:39,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:39,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-07 21:34:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-07 21:34:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11236, Invalid=15496, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 21:34:39,816 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2019-01-07 21:34:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:43,514 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-01-07 21:34:43,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-07 21:34:43,515 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2019-01-07 21:34:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:43,516 INFO L225 Difference]: With dead ends: 306 [2019-01-07 21:34:43,516 INFO L226 Difference]: Without dead ends: 305 [2019-01-07 21:34:43,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 471 SyntacticMatches, 18 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19201, Invalid=30305, Unknown=0, NotChecked=0, Total=49506 [2019-01-07 21:34:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-07 21:34:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-01-07 21:34:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-01-07 21:34:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-01-07 21:34:43,598 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2019-01-07 21:34:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:43,598 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-01-07 21:34:43,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-07 21:34:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-01-07 21:34:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-07 21:34:43,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:43,599 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2019-01-07 21:34:43,599 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:43,600 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2019-01-07 21:34:43,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:43,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:43,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:43,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:43,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:45,648 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-07 21:34:45,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:45,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:45,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:45,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:45,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:45,649 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-07 21:34:45,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:45,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:46,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-07 21:34:46,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:46,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:46,136 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-07 21:34:46,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:46,153 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-07 21:34:46,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:48,694 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-07 21:34:48,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:52,809 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-07 21:34:52,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:52,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-07 21:34:52,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:52,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-07 21:34:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-07 21:34:52,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11339, Invalid=15721, Unknown=0, NotChecked=0, Total=27060 [2019-01-07 21:34:52,832 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2019-01-07 21:34:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:56,550 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-07 21:34:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-07 21:34:56,557 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2019-01-07 21:34:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:56,558 INFO L225 Difference]: With dead ends: 311 [2019-01-07 21:34:56,558 INFO L226 Difference]: Without dead ends: 310 [2019-01-07 21:34:56,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 479 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19469, Invalid=30931, Unknown=0, NotChecked=0, Total=50400 [2019-01-07 21:34:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-07 21:34:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-01-07 21:34:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-07 21:34:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-01-07 21:34:56,640 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2019-01-07 21:34:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:56,640 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-01-07 21:34:56,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-07 21:34:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-01-07 21:34:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-01-07 21:34:56,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:56,642 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2019-01-07 21:34:56,642 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2019-01-07 21:34:56,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:56,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:56,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:58,870 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-07 21:34:58,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:58,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:58,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:58,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:58,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:58,871 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-07 21:34:58,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:34:58,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:34:59,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:34:59,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:59,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:59,112 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-07 21:34:59,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:59,120 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-07 21:34:59,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:01,609 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-07 21:35:01,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:05,895 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-07 21:35:05,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:05,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-07 21:35:05,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:05,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-07 21:35:05,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-07 21:35:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11442, Invalid=15948, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 21:35:05,918 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 126 states. [2019-01-07 21:35:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:09,983 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2019-01-07 21:35:09,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-07 21:35:09,983 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 306 [2019-01-07 21:35:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:09,984 INFO L225 Difference]: With dead ends: 316 [2019-01-07 21:35:09,984 INFO L226 Difference]: Without dead ends: 315 [2019-01-07 21:35:09,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 487 SyntacticMatches, 22 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19467 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=19738, Invalid=31564, Unknown=0, NotChecked=0, Total=51302 [2019-01-07 21:35:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-07 21:35:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-01-07 21:35:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-07 21:35:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2019-01-07 21:35:10,071 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 306 [2019-01-07 21:35:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:10,072 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2019-01-07 21:35:10,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-07 21:35:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2019-01-07 21:35:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-07 21:35:10,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:10,073 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1] [2019-01-07 21:35:10,073 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash -291628847, now seen corresponding path program 61 times [2019-01-07 21:35:10,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:10,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:10,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:10,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:10,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:12,319 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-07 21:35:12,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:12,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:12,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:12,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:12,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:12,320 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-07 21:35:12,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:12,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:35:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:12,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:12,542 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-07 21:35:12,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:12,554 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-07 21:35:12,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:15,053 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-07 21:35:15,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:19,311 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-07 21:35:19,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:19,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-07 21:35:19,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:19,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-07 21:35:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-07 21:35:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11545, Invalid=16177, Unknown=0, NotChecked=0, Total=27722 [2019-01-07 21:35:19,334 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 128 states. [2019-01-07 21:35:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:23,416 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-01-07 21:35:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-07 21:35:23,416 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 311 [2019-01-07 21:35:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:23,418 INFO L225 Difference]: With dead ends: 321 [2019-01-07 21:35:23,418 INFO L226 Difference]: Without dead ends: 320 [2019-01-07 21:35:23,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 495 SyntacticMatches, 24 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20090 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=20008, Invalid=32204, Unknown=0, NotChecked=0, Total=52212 [2019-01-07 21:35:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-07 21:35:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2019-01-07 21:35:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-07 21:35:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-07 21:35:23,501 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 311 [2019-01-07 21:35:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:23,502 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-07 21:35:23,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-07 21:35:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-07 21:35:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-07 21:35:23,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:23,504 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1] [2019-01-07 21:35:23,504 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash -537565849, now seen corresponding path program 62 times [2019-01-07 21:35:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:23,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:23,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:25,683 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-07 21:35:25,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:25,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:25,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:25,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:25,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:25,684 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-07 21:35:25,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:35:25,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:35:26,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-07 21:35:26,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:35:26,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:26,219 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-07 21:35:26,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:26,231 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-07 21:35:26,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:29,097 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-07 21:35:29,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:33,347 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-07 21:35:33,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:33,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-07 21:35:33,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:33,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-07 21:35:33,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-07 21:35:33,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11648, Invalid=16408, Unknown=0, NotChecked=0, Total=28056 [2019-01-07 21:35:33,370 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 130 states. [2019-01-07 21:35:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:37,476 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-01-07 21:35:37,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-07 21:35:37,476 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 316 [2019-01-07 21:35:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:37,477 INFO L225 Difference]: With dead ends: 326 [2019-01-07 21:35:37,477 INFO L226 Difference]: Without dead ends: 325 [2019-01-07 21:35:37,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 503 SyntacticMatches, 26 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20715 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=20279, Invalid=32851, Unknown=0, NotChecked=0, Total=53130 [2019-01-07 21:35:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-07 21:35:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2019-01-07 21:35:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-07 21:35:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-01-07 21:35:37,562 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 316 [2019-01-07 21:35:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:37,562 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2019-01-07 21:35:37,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-07 21:35:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2019-01-07 21:35:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-07 21:35:37,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:37,564 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1] [2019-01-07 21:35:37,564 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash -582711663, now seen corresponding path program 63 times [2019-01-07 21:35:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:37,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:37,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:39,997 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-07 21:35:39,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:39,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:39,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:39,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:39,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:39,998 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-07 21:35:40,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:35:40,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:35:40,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:35:40,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:35:40,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:40,257 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-07 21:35:40,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:40,266 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-07 21:35:40,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:43,012 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-07 21:35:43,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:47,071 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-07 21:35:47,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:47,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-07 21:35:47,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:47,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-07 21:35:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-07 21:35:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11751, Invalid=16641, Unknown=0, NotChecked=0, Total=28392 [2019-01-07 21:35:47,094 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 132 states. [2019-01-07 21:35:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:51,408 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-07 21:35:51,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-07 21:35:51,408 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 321 [2019-01-07 21:35:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:51,409 INFO L225 Difference]: With dead ends: 331 [2019-01-07 21:35:51,410 INFO L226 Difference]: Without dead ends: 330 [2019-01-07 21:35:51,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 511 SyntacticMatches, 28 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21342 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=20551, Invalid=33505, Unknown=0, NotChecked=0, Total=54056 [2019-01-07 21:35:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-07 21:35:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2019-01-07 21:35:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-01-07 21:35:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-01-07 21:35:51,500 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 321 [2019-01-07 21:35:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:51,500 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-01-07 21:35:51,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-07 21:35:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-01-07 21:35:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-07 21:35:51,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:51,502 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1] [2019-01-07 21:35:51,502 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1894616999, now seen corresponding path program 64 times [2019-01-07 21:35:51,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:51,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:51,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:54,087 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-07 21:35:54,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:54,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:54,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:54,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:54,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:54,087 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-07 21:35:54,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:54,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:35:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:54,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:54,325 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-07 21:35:54,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:54,339 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-07 21:35:54,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:57,219 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-07 21:35:57,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:01,645 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-07 21:36:01,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-07 21:36:01,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:01,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-07 21:36:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-07 21:36:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11854, Invalid=16876, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 21:36:01,668 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 134 states. [2019-01-07 21:36:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:06,241 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2019-01-07 21:36:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-07 21:36:06,242 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 326 [2019-01-07 21:36:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:06,243 INFO L225 Difference]: With dead ends: 336 [2019-01-07 21:36:06,243 INFO L226 Difference]: Without dead ends: 335 [2019-01-07 21:36:06,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 519 SyntacticMatches, 30 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21971 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=20824, Invalid=34166, Unknown=0, NotChecked=0, Total=54990 [2019-01-07 21:36:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-07 21:36:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-01-07 21:36:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-07 21:36:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2019-01-07 21:36:06,326 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 326 [2019-01-07 21:36:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:06,327 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2019-01-07 21:36:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-07 21:36:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2019-01-07 21:36:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-01-07 21:36:06,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:06,328 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1] [2019-01-07 21:36:06,328 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1074578513, now seen corresponding path program 65 times [2019-01-07 21:36:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:06,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:36:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:06,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:08,934 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-07 21:36:08,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:08,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:08,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:08,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:08,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:08,935 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-07 21:36:08,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:36:08,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:36:09,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-07 21:36:09,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:36:09,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:09,527 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-07 21:36:09,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:09,536 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-07 21:36:09,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:12,376 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-07 21:36:12,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:16,808 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-07 21:36:16,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:16,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-07 21:36:16,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:16,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-07 21:36:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-07 21:36:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11957, Invalid=17113, Unknown=0, NotChecked=0, Total=29070 [2019-01-07 21:36:16,831 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 136 states. [2019-01-07 21:36:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:21,418 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-01-07 21:36:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-07 21:36:21,419 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 331 [2019-01-07 21:36:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:21,420 INFO L225 Difference]: With dead ends: 341 [2019-01-07 21:36:21,420 INFO L226 Difference]: Without dead ends: 340 [2019-01-07 21:36:21,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 527 SyntacticMatches, 32 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22602 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21098, Invalid=34834, Unknown=0, NotChecked=0, Total=55932 [2019-01-07 21:36:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-01-07 21:36:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2019-01-07 21:36:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-07 21:36:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-07 21:36:21,529 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 331 [2019-01-07 21:36:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:21,529 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-07 21:36:21,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-07 21:36:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-07 21:36:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-07 21:36:21,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:21,531 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1] [2019-01-07 21:36:21,531 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash -362419737, now seen corresponding path program 66 times [2019-01-07 21:36:21,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:21,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:21,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:36:21,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:21,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:24,219 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-07 21:36:24,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:24,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:24,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:24,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:24,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:24,220 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-07 21:36:24,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:36:24,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:36:24,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:36:24,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:36:24,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:24,486 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-07 21:36:24,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:24,496 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-07 21:36:24,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:27,439 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-07 21:36:27,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:32,130 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-07 21:36:32,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:32,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-07 21:36:32,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:32,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-07 21:36:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-07 21:36:32,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12060, Invalid=17352, Unknown=0, NotChecked=0, Total=29412 [2019-01-07 21:36:32,152 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 138 states. [2019-01-07 21:36:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:36,864 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-01-07 21:36:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-07 21:36:36,864 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 336 [2019-01-07 21:36:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:36,865 INFO L225 Difference]: With dead ends: 346 [2019-01-07 21:36:36,865 INFO L226 Difference]: Without dead ends: 345 [2019-01-07 21:36:36,867 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-07 21:36:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-07 21:36:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-01-07 21:36:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-07 21:36:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2019-01-07 21:36:36,962 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 336 [2019-01-07 21:36:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:36,963 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2019-01-07 21:36:36,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-07 21:36:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2019-01-07 21:36:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-07 21:36:36,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:36,965 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1] [2019-01-07 21:36:36,965 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash -218967535, now seen corresponding path program 67 times [2019-01-07 21:36:36,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:36,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:36:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:36,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:39,755 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-07 21:36:39,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:39,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:39,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:39,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:39,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:39,756 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-07 21:36:39,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:36:39,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:36:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:39,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:39,999 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-07 21:36:39,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:40,008 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-07 21:36:40,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:43,051 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-07 21:36:43,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:47,504 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-07 21:36:47,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:47,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-07 21:36:47,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:47,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-07 21:36:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-07 21:36:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12163, Invalid=17593, Unknown=0, NotChecked=0, Total=29756 [2019-01-07 21:36:47,527 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 140 states. [2019-01-07 21:36:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:52,296 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-07 21:36:52,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-07 21:36:52,296 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 341 [2019-01-07 21:36:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:52,298 INFO L225 Difference]: With dead ends: 351 [2019-01-07 21:36:52,298 INFO L226 Difference]: Without dead ends: 350 [2019-01-07 21:36:52,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 543 SyntacticMatches, 36 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23870 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21649, Invalid=36191, Unknown=0, NotChecked=0, Total=57840 [2019-01-07 21:36:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-07 21:36:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-01-07 21:36:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-01-07 21:36:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-01-07 21:36:52,398 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 341 [2019-01-07 21:36:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:52,399 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-01-07 21:36:52,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-07 21:36:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-01-07 21:36:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-01-07 21:36:52,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:52,401 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1] [2019-01-07 21:36:52,401 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:52,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1914538969, now seen corresponding path program 68 times [2019-01-07 21:36:52,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:36:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:52,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:55,252 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-07 21:36:55,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:55,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:55,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:55,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:55,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:55,252 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-07 21:36:55,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:36:55,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:36:55,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-07 21:36:55,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:36:55,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:55,881 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-07 21:36:55,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:55,889 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-07 21:36:55,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:59,113 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-07 21:36:59,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:03,775 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-07 21:37:03,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:03,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-07 21:37:03,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:03,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-07 21:37:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-07 21:37:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12266, Invalid=17836, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 21:37:03,800 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 142 states. [2019-01-07 21:37:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:08,634 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2019-01-07 21:37:08,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-07 21:37:08,635 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 346 [2019-01-07 21:37:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:08,636 INFO L225 Difference]: With dead ends: 356 [2019-01-07 21:37:08,636 INFO L226 Difference]: Without dead ends: 355 [2019-01-07 21:37:08,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 551 SyntacticMatches, 38 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24507 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=21926, Invalid=36880, Unknown=0, NotChecked=0, Total=58806 [2019-01-07 21:37:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-01-07 21:37:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-01-07 21:37:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-01-07 21:37:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2019-01-07 21:37:08,741 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 346 [2019-01-07 21:37:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:08,741 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2019-01-07 21:37:08,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-07 21:37:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2019-01-07 21:37:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-01-07 21:37:08,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:08,743 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1] [2019-01-07 21:37:08,743 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 116568017, now seen corresponding path program 69 times [2019-01-07 21:37:08,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:08,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:08,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:08,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:08,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:11,589 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-07 21:37:11,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:11,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:11,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:11,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:11,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:11,589 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-07 21:37:11,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:37:11,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:37:11,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:37:11,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:11,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:11,862 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-07 21:37:11,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,870 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-07 21:37:11,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:37:15,121 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-07 21:37:15,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:19,528 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-07 21:37:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:19,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-07 21:37:19,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:19,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-07 21:37:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-07 21:37:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12369, Invalid=18081, Unknown=0, NotChecked=0, Total=30450 [2019-01-07 21:37:19,551 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 144 states. [2019-01-07 21:37:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:24,572 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-01-07 21:37:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-07 21:37:24,572 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 351 [2019-01-07 21:37:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:24,573 INFO L225 Difference]: With dead ends: 361 [2019-01-07 21:37:24,574 INFO L226 Difference]: Without dead ends: 360 [2019-01-07 21:37:24,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 559 SyntacticMatches, 40 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25146 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=22204, Invalid=37576, Unknown=0, NotChecked=0, Total=59780 [2019-01-07 21:37:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-01-07 21:37:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2019-01-07 21:37:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-07 21:37:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-07 21:37:24,682 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 351 [2019-01-07 21:37:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:24,683 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-07 21:37:24,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-07 21:37:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-07 21:37:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-07 21:37:24,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:24,684 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1] [2019-01-07 21:37:24,684 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2014892441, now seen corresponding path program 70 times [2019-01-07 21:37:24,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:24,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:24,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:24,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:24,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:27,735 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-07 21:37:27,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:27,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:27,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:27,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:27,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:27,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 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-07 21:37:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:27,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:27,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:27,995 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-07 21:37:27,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:28,005 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-07 21:37:28,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:37:31,460 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-07 21:37:31,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:35,940 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-07 21:37:35,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:35,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-07 21:37:35,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:35,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-07 21:37:35,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-07 21:37:35,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12472, Invalid=18328, Unknown=0, NotChecked=0, Total=30800 [2019-01-07 21:37:35,963 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 146 states. [2019-01-07 21:37:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:40,955 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-01-07 21:37:40,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-07 21:37:40,955 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 356 [2019-01-07 21:37:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:40,956 INFO L225 Difference]: With dead ends: 366 [2019-01-07 21:37:40,957 INFO L226 Difference]: Without dead ends: 365 [2019-01-07 21:37:40,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 567 SyntacticMatches, 42 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25787 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=22483, Invalid=38279, Unknown=0, NotChecked=0, Total=60762 [2019-01-07 21:37:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-07 21:37:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-01-07 21:37:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-01-07 21:37:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2019-01-07 21:37:41,059 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 356 [2019-01-07 21:37:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:41,059 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2019-01-07 21:37:41,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-07 21:37:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2019-01-07 21:37:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-01-07 21:37:41,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:41,060 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1] [2019-01-07 21:37:41,061 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2113380975, now seen corresponding path program 71 times [2019-01-07 21:37:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:41,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:43,939 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-07 21:37:43,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:43,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:43,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:43,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:43,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:43,940 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-07 21:37:43,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:37:43,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:37:44,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-07 21:37:44,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:44,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:44,636 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-07 21:37:44,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,646 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-07 21:37:44,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:37:48,117 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-07 21:37:48,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:52,695 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-07 21:37:52,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:52,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-07 21:37:52,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:52,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-07 21:37:52,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-07 21:37:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12575, Invalid=18577, Unknown=0, NotChecked=0, Total=31152 [2019-01-07 21:37:52,718 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 148 states. [2019-01-07 21:37:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:57,963 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-07 21:37:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-07 21:37:57,963 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 361 [2019-01-07 21:37:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:57,965 INFO L225 Difference]: With dead ends: 371 [2019-01-07 21:37:57,965 INFO L226 Difference]: Without dead ends: 370 [2019-01-07 21:37:57,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 575 SyntacticMatches, 44 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26430 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=22763, Invalid=38989, Unknown=0, NotChecked=0, Total=61752 [2019-01-07 21:37:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-07 21:37:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-01-07 21:37:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-07 21:37:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2019-01-07 21:37:58,071 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 361 [2019-01-07 21:37:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:58,071 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2019-01-07 21:37:58,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-07 21:37:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2019-01-07 21:37:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-01-07 21:37:58,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:58,072 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1] [2019-01-07 21:37:58,073 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash 804788391, now seen corresponding path program 72 times [2019-01-07 21:37:58,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:58,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:58,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:58,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:00,929 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-07 21:38:00,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:00,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:00,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:00,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:00,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:00,930 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-07 21:38:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:38:00,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:38:01,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:38:01,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:01,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:01,219 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-07 21:38:01,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,229 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-07 21:38:01,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:38:04,657 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-07 21:38:04,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:09,258 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-07 21:38:09,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:09,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-07 21:38:09,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:09,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-07 21:38:09,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-07 21:38:09,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12678, Invalid=18828, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 21:38:09,282 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 150 states. [2019-01-07 21:38:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:14,823 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2019-01-07 21:38:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-07 21:38:14,823 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 366 [2019-01-07 21:38:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:14,825 INFO L225 Difference]: With dead ends: 376 [2019-01-07 21:38:14,825 INFO L226 Difference]: Without dead ends: 375 [2019-01-07 21:38:14,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 583 SyntacticMatches, 46 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27075 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23044, Invalid=39706, Unknown=0, NotChecked=0, Total=62750 [2019-01-07 21:38:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-01-07 21:38:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-01-07 21:38:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-07 21:38:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2019-01-07 21:38:14,944 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 366 [2019-01-07 21:38:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:14,944 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2019-01-07 21:38:14,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-07 21:38:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2019-01-07 21:38:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-07 21:38:14,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:14,946 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1, 1] [2019-01-07 21:38:14,946 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:38:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash 523230033, now seen corresponding path program 73 times [2019-01-07 21:38:14,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:14,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:14,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:18,141 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-07 21:38:18,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:18,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:18,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:18,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:18,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:18,142 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-07 21:38:18,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:18,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:18,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:18,413 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-07 21:38:18,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,423 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-07 21:38:18,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:38:22,291 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-07 21:38:22,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:26,679 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-07 21:38:26,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:26,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-07 21:38:26,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:26,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-07 21:38:26,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-07 21:38:26,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12781, Invalid=19081, Unknown=0, NotChecked=0, Total=31862 [2019-01-07 21:38:26,702 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 152 states. [2019-01-07 21:38:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:32,311 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2019-01-07 21:38:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-07 21:38:32,311 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 371 [2019-01-07 21:38:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:32,313 INFO L225 Difference]: With dead ends: 381 [2019-01-07 21:38:32,313 INFO L226 Difference]: Without dead ends: 380 [2019-01-07 21:38:32,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 591 SyntacticMatches, 48 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=23326, Invalid=40430, Unknown=0, NotChecked=0, Total=63756 [2019-01-07 21:38:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-07 21:38:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2019-01-07 21:38:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-07 21:38:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-07 21:38:32,435 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 371 [2019-01-07 21:38:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:32,435 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-07 21:38:32,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-07 21:38:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-07 21:38:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-07 21:38:32,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:32,437 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1, 1] [2019-01-07 21:38:32,437 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:38:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:32,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1217999591, now seen corresponding path program 74 times [2019-01-07 21:38:32,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:32,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:32,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:35,462 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-07 21:38:35,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:35,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:35,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:35,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:35,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:35,463 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-07 21:38:35,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:35,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:36,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-07 21:38:36,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:36,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:36,139 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-07 21:38:36,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:36,150 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-07 21:38:36,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:38:40,025 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-07 21:38:40,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:44,713 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-07 21:38:44,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:44,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-07 21:38:44,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:44,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-07 21:38:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-07 21:38:44,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12884, Invalid=19336, Unknown=0, NotChecked=0, Total=32220 [2019-01-07 21:38:44,737 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 154 states. [2019-01-07 21:38:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:50,475 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-01-07 21:38:50,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-07 21:38:50,475 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 376 [2019-01-07 21:38:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:50,477 INFO L225 Difference]: With dead ends: 386 [2019-01-07 21:38:50,477 INFO L226 Difference]: Without dead ends: 385 [2019-01-07 21:38:50,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 599 SyntacticMatches, 50 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28371 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=23609, Invalid=41161, Unknown=0, NotChecked=0, Total=64770 [2019-01-07 21:38:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-01-07 21:38:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-01-07 21:38:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-07 21:38:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2019-01-07 21:38:50,600 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 376 [2019-01-07 21:38:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:50,601 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2019-01-07 21:38:50,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-07 21:38:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2019-01-07 21:38:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-01-07 21:38:50,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:50,602 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1, 1] [2019-01-07 21:38:50,602 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:38:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash 241510673, now seen corresponding path program 75 times [2019-01-07 21:38:50,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:50,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:50,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:50,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:53,998 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-07 21:38:53,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:53,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:53,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:53,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:53,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:53,998 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-07 21:38:54,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:38:54,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:38:54,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:38:54,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:54,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:54,302 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-07 21:38:54,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,310 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-07 21:38:54,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:38:58,290 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-07 21:38:58,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:02,828 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-07 21:39:02,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:02,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-07 21:39:02,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:02,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-07 21:39:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-07 21:39:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12987, Invalid=19593, Unknown=0, NotChecked=0, Total=32580 [2019-01-07 21:39:02,851 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 156 states. [2019-01-07 21:39:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:08,695 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-07 21:39:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-07 21:39:08,695 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 381 [2019-01-07 21:39:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:08,697 INFO L225 Difference]: With dead ends: 391 [2019-01-07 21:39:08,697 INFO L226 Difference]: Without dead ends: 390 [2019-01-07 21:39:08,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 607 SyntacticMatches, 52 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29022 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=23893, Invalid=41899, Unknown=0, NotChecked=0, Total=65792 [2019-01-07 21:39:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-07 21:39:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2019-01-07 21:39:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-01-07 21:39:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-01-07 21:39:08,821 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 381 [2019-01-07 21:39:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:08,821 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2019-01-07 21:39:08,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-07 21:39:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2019-01-07 21:39:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-01-07 21:39:08,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:08,823 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1, 1] [2019-01-07 21:39:08,823 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:39:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1062108455, now seen corresponding path program 76 times [2019-01-07 21:39:08,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:08,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:08,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:08,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:12,003 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-07 21:39:12,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:12,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:12,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:12,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:12,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:12,004 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-07 21:39:12,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:12,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:12,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:12,289 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-07 21:39:12,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:12,298 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-07 21:39:12,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:39:16,243 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-07 21:39:16,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:20,879 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-07 21:39:20,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:20,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-07 21:39:20,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:20,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-07 21:39:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-07 21:39:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13090, Invalid=19852, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 21:39:20,942 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 158 states. [2019-01-07 21:39:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:27,020 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2019-01-07 21:39:27,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-07 21:39:27,020 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 386 [2019-01-07 21:39:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:27,021 INFO L225 Difference]: With dead ends: 396 [2019-01-07 21:39:27,022 INFO L226 Difference]: Without dead ends: 395 [2019-01-07 21:39:27,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 615 SyntacticMatches, 54 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29675 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=24178, Invalid=42644, Unknown=0, NotChecked=0, Total=66822 [2019-01-07 21:39:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-01-07 21:39:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2019-01-07 21:39:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-07 21:39:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2019-01-07 21:39:27,151 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 386 [2019-01-07 21:39:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:27,151 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2019-01-07 21:39:27,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-07 21:39:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2019-01-07 21:39:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-01-07 21:39:27,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:27,152 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1, 1] [2019-01-07 21:39:27,153 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:39:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1264302383, now seen corresponding path program 77 times [2019-01-07 21:39:27,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:27,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:27,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:27,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:27,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:30,766 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-07 21:39:30,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:30,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:30,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:30,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:30,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:30,767 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-07 21:39:30,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:30,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:31,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-07 21:39:31,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:31,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:31,600 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-07 21:39:31,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:31,616 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-07 21:39:31,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:39:35,900 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-07 21:39:35,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:40,641 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-07 21:39:40,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:40,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-07 21:39:40,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:40,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-07 21:39:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-07 21:39:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13193, Invalid=20113, Unknown=0, NotChecked=0, Total=33306 [2019-01-07 21:39:40,665 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 160 states. [2019-01-07 21:39:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:46,882 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2019-01-07 21:39:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-07 21:39:46,882 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 391 [2019-01-07 21:39:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:46,884 INFO L225 Difference]: With dead ends: 401 [2019-01-07 21:39:46,884 INFO L226 Difference]: Without dead ends: 400 [2019-01-07 21:39:46,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 623 SyntacticMatches, 56 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30330 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=24464, Invalid=43396, Unknown=0, NotChecked=0, Total=67860 [2019-01-07 21:39:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-01-07 21:39:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2019-01-07 21:39:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-07 21:39:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-07 21:39:47,021 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 391 [2019-01-07 21:39:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:47,021 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-07 21:39:47,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-07 21:39:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-07 21:39:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-07 21:39:47,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:47,023 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1, 1] [2019-01-07 21:39:47,023 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:39:47,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1822160743, now seen corresponding path program 78 times [2019-01-07 21:39:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:47,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:47,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:50,764 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-07 21:39:50,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:50,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:50,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:50,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:50,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:50,765 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-07 21:39:50,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:39:50,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:39:51,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:39:51,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:51,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:51,084 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-07 21:39:51,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:51,094 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-07 21:39:51,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:39:55,347 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-07 21:39:55,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:00,185 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-07 21:40:00,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:00,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-07 21:40:00,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:00,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-07 21:40:00,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-07 21:40:00,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13296, Invalid=20376, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 21:40:00,209 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 162 states. [2019-01-07 21:40:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:06,650 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2019-01-07 21:40:06,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-07 21:40:06,651 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 396 [2019-01-07 21:40:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:06,652 INFO L225 Difference]: With dead ends: 406 [2019-01-07 21:40:06,652 INFO L226 Difference]: Without dead ends: 405 [2019-01-07 21:40:06,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 631 SyntacticMatches, 58 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30987 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=24751, Invalid=44155, Unknown=0, NotChecked=0, Total=68906 [2019-01-07 21:40:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-07 21:40:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-01-07 21:40:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-07 21:40:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2019-01-07 21:40:06,792 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 396 [2019-01-07 21:40:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:06,792 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2019-01-07 21:40:06,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-07 21:40:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2019-01-07 21:40:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-07 21:40:06,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:06,794 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1, 1] [2019-01-07 21:40:06,794 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:40:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1810445457, now seen corresponding path program 79 times [2019-01-07 21:40:06,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:06,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:06,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:06,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:06,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:10,436 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-07 21:40:10,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:10,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:10,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:10,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:10,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:10,437 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-07 21:40:10,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:10,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:10,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:10,793 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-07 21:40:10,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:10,801 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-07 21:40:10,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:40:15,028 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-07 21:40:15,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:19,857 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-07 21:40:19,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:19,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-07 21:40:19,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:19,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-07 21:40:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-07 21:40:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13399, Invalid=20641, Unknown=0, NotChecked=0, Total=34040 [2019-01-07 21:40:19,880 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 164 states. [2019-01-07 21:40:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:26,298 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2019-01-07 21:40:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-07 21:40:26,298 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 401 [2019-01-07 21:40:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:26,300 INFO L225 Difference]: With dead ends: 411 [2019-01-07 21:40:26,300 INFO L226 Difference]: Without dead ends: 410 [2019-01-07 21:40:26,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 639 SyntacticMatches, 60 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31646 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=25039, Invalid=44921, Unknown=0, NotChecked=0, Total=69960 [2019-01-07 21:40:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-07 21:40:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2019-01-07 21:40:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-07 21:40:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2019-01-07 21:40:26,435 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 401 [2019-01-07 21:40:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:26,435 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2019-01-07 21:40:26,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-07 21:40:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2019-01-07 21:40:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-07 21:40:26,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:26,437 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1, 1] [2019-01-07 21:40:26,437 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:40:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1409655207, now seen corresponding path program 80 times [2019-01-07 21:40:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:26,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:26,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:30,108 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-07 21:40:30,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:30,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:30,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:30,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:30,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:30,109 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-07 21:40:30,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:40:30,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:40:30,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-07 21:40:30,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:40:31,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:31,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-07 21:40:31,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:31,020 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-07 21:40:31,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:40:35,418 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-07 21:40:35,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:40,415 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-07 21:40:40,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:40,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-07 21:40:40,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:40,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-07 21:40:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-07 21:40:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13502, Invalid=20908, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 21:40:40,440 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 166 states. [2019-01-07 21:40:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:47,158 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2019-01-07 21:40:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-07 21:40:47,159 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 406 [2019-01-07 21:40:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:47,160 INFO L225 Difference]: With dead ends: 416 [2019-01-07 21:40:47,160 INFO L226 Difference]: Without dead ends: 415 [2019-01-07 21:40:47,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 647 SyntacticMatches, 62 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32307 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=25328, Invalid=45694, Unknown=0, NotChecked=0, Total=71022 [2019-01-07 21:40:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-07 21:40:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2019-01-07 21:40:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-07 21:40:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2019-01-07 21:40:47,307 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 406 [2019-01-07 21:40:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:47,308 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2019-01-07 21:40:47,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-07 21:40:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2019-01-07 21:40:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-01-07 21:40:47,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:47,309 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1, 1] [2019-01-07 21:40:47,310 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:40:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1127215697, now seen corresponding path program 81 times [2019-01-07 21:40:47,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:47,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:47,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:51,181 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-07 21:40:51,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:51,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:51,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:51,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:51,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:51,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 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-07 21:40:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:40:51,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:40:51,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:40:51,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:40:51,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:51,510 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-07 21:40:51,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:51,518 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-07 21:40:51,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:40:55,935 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-07 21:40:55,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:00,835 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-07 21:41:00,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:00,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-07 21:41:00,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:00,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-07 21:41:00,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-07 21:41:00,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13605, Invalid=21177, Unknown=0, NotChecked=0, Total=34782 [2019-01-07 21:41:00,859 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 168 states. [2019-01-07 21:41:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:07,628 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2019-01-07 21:41:07,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-07 21:41:07,629 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 411 [2019-01-07 21:41:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:07,630 INFO L225 Difference]: With dead ends: 421 [2019-01-07 21:41:07,630 INFO L226 Difference]: Without dead ends: 420 [2019-01-07 21:41:07,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 655 SyntacticMatches, 64 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32970 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=25618, Invalid=46474, Unknown=0, NotChecked=0, Total=72092 [2019-01-07 21:41:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-07 21:41:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2019-01-07 21:41:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-01-07 21:41:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-01-07 21:41:07,779 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 411 [2019-01-07 21:41:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:07,780 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2019-01-07 21:41:07,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-07 21:41:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2019-01-07 21:41:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-01-07 21:41:07,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:07,782 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1, 1] [2019-01-07 21:41:07,782 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:41:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash -468747289, now seen corresponding path program 82 times [2019-01-07 21:41:07,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:07,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:07,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:11,596 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-07 21:41:11,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:11,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:11,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:11,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:11,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:11,597 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-07 21:41:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:11,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:11,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:11,893 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-07 21:41:11,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:11,904 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-07 21:41:11,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:41:16,529 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-07 21:41:16,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:21,471 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-07 21:41:21,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:21,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-07 21:41:21,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:21,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-07 21:41:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-07 21:41:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13708, Invalid=21448, Unknown=0, NotChecked=0, Total=35156 [2019-01-07 21:41:21,497 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 170 states. [2019-01-07 21:41:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:28,418 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2019-01-07 21:41:28,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-07 21:41:28,419 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 416 [2019-01-07 21:41:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:28,420 INFO L225 Difference]: With dead ends: 426 [2019-01-07 21:41:28,420 INFO L226 Difference]: Without dead ends: 425 [2019-01-07 21:41:28,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 663 SyntacticMatches, 66 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33635 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=25909, Invalid=47261, Unknown=0, NotChecked=0, Total=73170 [2019-01-07 21:41:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-01-07 21:41:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2019-01-07 21:41:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-01-07 21:41:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2019-01-07 21:41:28,577 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 416 [2019-01-07 21:41:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:28,577 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2019-01-07 21:41:28,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-07 21:41:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2019-01-07 21:41:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-07 21:41:28,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:28,580 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1, 1] [2019-01-07 21:41:28,580 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:41:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1099661295, now seen corresponding path program 83 times [2019-01-07 21:41:28,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:28,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:28,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:32,862 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-07 21:41:32,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:32,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:32,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:32,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:32,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:32,863 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-07 21:41:32,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:41:32,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:41:33,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-07 21:41:33,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:33,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:33,858 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-07 21:41:33,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:33,866 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-07 21:41:33,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:41:38,443 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-07 21:41:38,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:43,223 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-07 21:41:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:43,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-07 21:41:43,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:43,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-07 21:41:43,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-07 21:41:43,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13811, Invalid=21721, Unknown=0, NotChecked=0, Total=35532 [2019-01-07 21:41:43,249 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 172 states. [2019-01-07 21:41:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:49,907 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2019-01-07 21:41:49,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-07 21:41:49,908 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 421 [2019-01-07 21:41:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:49,909 INFO L225 Difference]: With dead ends: 431 [2019-01-07 21:41:49,909 INFO L226 Difference]: Without dead ends: 430 [2019-01-07 21:41:49,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 671 SyntacticMatches, 68 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34302 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=26201, Invalid=48055, Unknown=0, NotChecked=0, Total=74256 [2019-01-07 21:41:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-07 21:41:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-01-07 21:41:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-07 21:41:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2019-01-07 21:41:50,054 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 421 [2019-01-07 21:41:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:50,055 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2019-01-07 21:41:50,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-07 21:41:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2019-01-07 21:41:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-01-07 21:41:50,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:50,057 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1, 1] [2019-01-07 21:41:50,057 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:41:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1237481945, now seen corresponding path program 84 times [2019-01-07 21:41:50,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:50,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:50,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:50,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:50,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:54,146 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-07 21:41:54,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:54,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:54,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:54,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:54,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:54,147 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-07 21:41:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:41:54,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:41:54,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:41:54,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:54,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:54,471 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-07 21:41:54,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,484 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-07 21:41:54,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:41:59,143 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-07 21:41:59,143 INFO L316 TraceCheckSpWp]: Computing backward predicates...