java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:55:57,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:55:57,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:55:57,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:55:57,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:55:57,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:55:57,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:55:57,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:55:57,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:55:57,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:55:57,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:55:57,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:55:57,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:55:57,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:55:57,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:55:57,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:55:57,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:55:57,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:55:57,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:55:57,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:55:57,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:55:57,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:55:57,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:55:57,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:55:57,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:55:57,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:55:57,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:55:57,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:55:57,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:55:57,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:55:57,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:55:57,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:55:57,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:55:57,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:55:57,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:55:57,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:55:57,701 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 09:55:57,714 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:55:57,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:55:57,716 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:55:57,716 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:55:57,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:55:57,716 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:55:57,717 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:55:57,717 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:55:57,717 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:55:57,717 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:55:57,717 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:55:57,718 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:55:57,718 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:55:57,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:55:57,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:55:57,719 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:55:57,719 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:55:57,719 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:55:57,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:55:57,720 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:55:57,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:55:57,720 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:55:57,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:55:57,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:55:57,721 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:55:57,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:55:57,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:55:57,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:55:57,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:55:57,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:55:57,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:55:57,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:55:57,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:55:57,722 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:55:57,723 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:55:57,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:55:57,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:55:57,723 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:55:57,723 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:55:57,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:55:57,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:55:57,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:55:57,778 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:55:57,779 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:55:57,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-02-18 09:55:57,780 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-02-18 09:55:57,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:55:57,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:55:57,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:55:57,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:55:57,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:55:57,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,882 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-18 09:55:57,882 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-18 09:55:57,883 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-18 09:55:57,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:55:57,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:55:57,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:55:57,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:55:57,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/1) ... [2019-02-18 09:55:57,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:55:57,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:55:57,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:55:57,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:55:57,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:55:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-02-18 09:55:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-18 09:55:58,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-18 09:55:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-18 09:55:58,317 INFO L278 CfgBuilder]: Using library mode [2019-02-18 09:55:58,318 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-18 09:55:58,320 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:55:58 BoogieIcfgContainer [2019-02-18 09:55:58,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:55:58,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:55:58,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:55:58,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:55:58,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:55:57" (1/2) ... [2019-02-18 09:55:58,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f7ba7d and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:55:58, skipping insertion in model container [2019-02-18 09:55:58,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:55:58" (2/2) ... [2019-02-18 09:55:58,343 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-02-18 09:55:58,355 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:55:58,368 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-18 09:55:58,392 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-18 09:55:58,430 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:55:58,430 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:55:58,431 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:55:58,431 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:55:58,431 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:55:58,431 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:55:58,431 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:55:58,432 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:55:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-18 09:55:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:55:58,471 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:58,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:55:58,477 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:55:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-18 09:55:58,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:58,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:58,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:58,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:55:58,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:55:58,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:55:58,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:55:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:55:58,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:55:58,826 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-02-18 09:55:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:58,955 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-02-18 09:55:58,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:55:58,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:55:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:58,977 INFO L225 Difference]: With dead ends: 20 [2019-02-18 09:55:58,979 INFO L226 Difference]: Without dead ends: 10 [2019-02-18 09:55:58,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:55:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-18 09:55:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-02-18 09:55:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-18 09:55:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-18 09:55:59,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-18 09:55:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:59,028 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-18 09:55:59,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:55:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-18 09:55:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:55:59,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:59,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:55:59,030 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:55:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-02-18 09:55:59,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:59,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:55:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:55:59,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:55:59,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:55:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:55:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:55:59,356 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-02-18 09:55:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:59,640 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-02-18 09:55:59,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:55:59,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-18 09:55:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:59,641 INFO L225 Difference]: With dead ends: 17 [2019-02-18 09:55:59,641 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 09:55:59,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:55:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 09:55:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-02-18 09:55:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:55:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-18 09:55:59,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-02-18 09:55:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:59,649 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-18 09:55:59,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:55:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-18 09:55:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:55:59,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:59,650 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 09:55:59,650 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:55:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-02-18 09:55:59,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:59,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:59,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:59,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:59,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:59,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:55:59,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:55:59,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:55:59,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:55:59,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:55:59,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:55:59,722 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-02-18 09:55:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:59,741 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-02-18 09:55:59,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:55:59,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-02-18 09:55:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:59,745 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:55:59,745 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:55:59,746 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-02-18 09:55:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:55:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-18 09:55:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:55:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-18 09:55:59,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-02-18 09:55:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:59,752 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-18 09:55:59,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:55:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-18 09:55:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:55:59,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:59,754 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-02-18 09:55:59,754 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:55:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-02-18 09:55:59,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:59,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:59,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:59,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:59,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:59,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 09:55:59,998 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-02-18 09:56:00,063 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:56:00,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:57:04,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:57:04,328 INFO L272 AbstractInterpreter]: Visited 7 different actions 85 times. Merged at 6 different actions 78 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:57:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:04,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:57:04,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:04,339 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-02-18 09:57:04,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:04,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:04,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:04,477 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-02-18 09:57:04,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:04,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:04,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:05,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:05,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:05,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:57:05,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:05,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:57:05,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:57:05,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:57:05,579 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-02-18 09:57:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:05,807 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-18 09:57:05,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:57:05,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-02-18 09:57:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:05,808 INFO L225 Difference]: With dead ends: 20 [2019-02-18 09:57:05,809 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:57:05,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:57:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:57:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-02-18 09:57:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:57:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-18 09:57:05,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-02-18 09:57:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:05,815 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-18 09:57:05,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:57:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-18 09:57:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-18 09:57:05,816 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:05,816 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-02-18 09:57:05,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-02-18 09:57:05,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:05,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:06,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:06,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:06,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:06,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:06,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:06,033 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-02-18 09:57:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:06,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:06,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:57:06,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:06,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:06,131 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-02-18 09:57:06,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:06,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:06,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:06,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:06,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:06,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:57:06,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:06,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:57:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:57:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:57:06,697 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-02-18 09:57:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:06,937 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-18 09:57:06,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:57:06,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-02-18 09:57:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:06,941 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:57:06,941 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 09:57:06,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:57:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 09:57:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-02-18 09:57:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:57:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-18 09:57:06,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-02-18 09:57:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:06,948 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-18 09:57:06,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:57:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-18 09:57:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:57:06,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:06,949 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-02-18 09:57:06,950 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-02-18 09:57:06,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:06,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:06,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:07,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:07,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:07,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:07,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:07,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:07,103 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-02-18 09:57:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:07,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:07,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:07,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:07,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:07,162 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-02-18 09:57:07,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:07,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:07,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:07,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:07,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:07,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:57:07,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:07,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:57:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:57:07,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:57:07,448 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-18 09:57:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:07,627 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-18 09:57:07,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:57:07,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-18 09:57:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:07,631 INFO L225 Difference]: With dead ends: 30 [2019-02-18 09:57:07,631 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:57:07,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:57:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:57:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-02-18 09:57:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:57:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-18 09:57:07,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-02-18 09:57:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:07,638 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-18 09:57:07,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:57:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-18 09:57:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-18 09:57:07,640 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:07,640 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-02-18 09:57:07,641 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-02-18 09:57:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:07,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:07,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:07,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:07,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:07,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:07,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:07,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:07,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:07,777 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-02-18 09:57:07,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:07,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:07,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:07,838 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-02-18 09:57:07,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:07,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:07,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:08,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:08,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:08,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-18 09:57:08,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:08,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:57:08,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:57:08,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:57:08,248 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-02-18 09:57:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:08,593 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-18 09:57:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:57:08,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-02-18 09:57:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:08,595 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:57:08,595 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:57:08,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:57:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:57:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-02-18 09:57:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:57:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-18 09:57:08,602 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-02-18 09:57:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:08,603 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-18 09:57:08,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:57:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-18 09:57:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:57:08,604 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:08,604 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-02-18 09:57:08,604 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:08,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-02-18 09:57:08,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:08,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:08,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:08,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:08,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:08,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:08,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:08,762 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-02-18 09:57:08,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:08,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:08,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-18 09:57:08,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:08,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:08,810 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-02-18 09:57:08,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:08,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:08,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:08,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:09,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:09,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-18 09:57:09,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:09,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:57:09,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:57:09,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:57:09,113 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-02-18 09:57:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:09,623 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-18 09:57:09,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:57:09,624 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-18 09:57:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:09,625 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:57:09,625 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:57:09,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:57:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:57:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-02-18 09:57:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:57:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-18 09:57:09,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-02-18 09:57:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:09,633 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-18 09:57:09,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:57:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-18 09:57:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-18 09:57:09,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:09,634 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-02-18 09:57:09,635 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-02-18 09:57:09,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:09,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:09,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:09,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:09,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:09,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:09,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:09,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:09,844 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-02-18 09:57:09,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:09,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:09,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:09,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:09,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:09,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:57:09,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:09,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:09,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:10,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:10,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:10,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-18 09:57:10,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:10,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:57:10,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:57:10,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:57:10,308 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-02-18 09:57:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:10,637 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-18 09:57:10,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:57:10,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-02-18 09:57:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:10,641 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:57:10,641 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:57:10,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:57:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:57:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-02-18 09:57:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:57:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-18 09:57:10,653 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-02-18 09:57:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:10,653 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-18 09:57:10,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:57:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-18 09:57:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:57:10,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:10,655 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-02-18 09:57:10,655 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:10,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-02-18 09:57:10,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:10,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:10,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:10,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:10,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:10,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:10,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:10,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:10,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:10,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:10,852 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-02-18 09:57:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:10,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:10,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:10,902 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-02-18 09:57:10,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:10,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-02-18 09:57:10,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:11,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:11,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-18 09:57:11,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:11,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:57:11,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:57:11,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:57:11,345 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-02-18 09:57:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:11,756 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-18 09:57:11,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:57:11,757 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-02-18 09:57:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:11,759 INFO L225 Difference]: With dead ends: 50 [2019-02-18 09:57:11,759 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:57:11,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:57:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:57:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-02-18 09:57:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:57:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-18 09:57:11,767 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-02-18 09:57:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:11,768 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-18 09:57:11,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:57:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-18 09:57:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-18 09:57:11,769 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:11,769 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-02-18 09:57:11,769 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-02-18 09:57:11,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:11,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:12,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:12,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:12,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:12,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:12,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:12,523 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-02-18 09:57:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:12,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:12,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-18 09:57:12,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:12,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:12,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-02-18 09:57:12,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:12,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-02-18 09:57:12,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:12,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:13,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:13,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-18 09:57:13,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:13,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:57:13,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:57:13,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:57:13,246 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-02-18 09:57:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:13,590 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-18 09:57:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:57:13,591 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-02-18 09:57:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:13,592 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:57:13,593 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:57:13,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:57:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:57:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-02-18 09:57:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:57:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-18 09:57:13,603 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-02-18 09:57:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:13,604 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-18 09:57:13,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:57:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-18 09:57:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-18 09:57:13,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:13,605 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-02-18 09:57:13,605 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-02-18 09:57:13,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:13,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:13,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:13,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:13,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:14,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:14,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:14,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:14,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:14,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:14,137 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-02-18 09:57:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:14,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:14,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:14,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:14,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:14,194 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-02-18 09:57:14,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:14,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:14,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:14,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:14,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:14,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-18 09:57:14,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:14,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:57:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:57:14,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-02-18 09:57:14,640 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-02-18 09:57:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:15,153 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-18 09:57:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:57:15,154 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-02-18 09:57:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:15,155 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:57:15,155 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:57:15,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:57:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:57:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-02-18 09:57:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-18 09:57:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-18 09:57:15,166 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-02-18 09:57:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:15,166 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-18 09:57:15,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:57:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-18 09:57:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-18 09:57:15,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:15,168 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-02-18 09:57:15,168 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-02-18 09:57:15,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:15,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:15,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:15,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:15,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:16,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:16,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:16,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:16,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:16,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:16,110 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-02-18 09:57:16,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:16,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:16,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:16,171 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-02-18 09:57:16,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:16,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:16,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:16,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:16,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:16,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-18 09:57:16,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:16,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:57:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:57:16,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:57:16,664 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-02-18 09:57:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:17,097 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-18 09:57:17,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:57:17,097 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-18 09:57:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:17,098 INFO L225 Difference]: With dead ends: 65 [2019-02-18 09:57:17,098 INFO L226 Difference]: Without dead ends: 64 [2019-02-18 09:57:17,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:57:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-18 09:57:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-02-18 09:57:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:57:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-18 09:57:17,110 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-02-18 09:57:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:17,110 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-18 09:57:17,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:57:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-18 09:57:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:57:17,111 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:17,112 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-02-18 09:57:17,112 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:17,112 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-02-18 09:57:17,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:17,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:17,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:17,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:17,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:17,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:17,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:17,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:17,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:17,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:17,501 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-02-18 09:57:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:17,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:17,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-18 09:57:17,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:17,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:17,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:57:17,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:17,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:17,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:17,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:18,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:18,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-18 09:57:18,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:18,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:57:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:57:18,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-02-18 09:57:18,383 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-02-18 09:57:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:18,871 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-18 09:57:18,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:57:18,872 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-02-18 09:57:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:18,873 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:57:18,873 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:57:18,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:57:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:57:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-02-18 09:57:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:57:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-18 09:57:18,887 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-02-18 09:57:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:18,888 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-18 09:57:18,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:57:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-18 09:57:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-18 09:57:18,889 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:18,889 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-02-18 09:57:18,890 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-02-18 09:57:18,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:18,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:18,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:18,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:19,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:19,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:19,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:19,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:19,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:19,666 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-02-18 09:57:19,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:19,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:19,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:19,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:19,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:19,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:57:19,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:19,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:19,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:20,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:20,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:20,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-18 09:57:20,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:20,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:57:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:57:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:57:20,486 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-02-18 09:57:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:20,939 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-18 09:57:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:57:20,939 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-02-18 09:57:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:20,940 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:57:20,940 INFO L226 Difference]: Without dead ends: 74 [2019-02-18 09:57:20,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:57:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-18 09:57:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-02-18 09:57:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:57:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-18 09:57:20,954 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-02-18 09:57:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:20,955 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-18 09:57:20,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:57:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-18 09:57:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-18 09:57:20,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:20,956 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-02-18 09:57:20,956 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-02-18 09:57:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:20,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:20,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:21,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:21,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:21,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:21,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:21,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:21,276 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-02-18 09:57:21,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:21,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:21,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:21,346 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-02-18 09:57:21,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:21,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:21,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:21,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:22,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:22,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-18 09:57:22,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:22,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:57:22,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:57:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:57:22,093 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-02-18 09:57:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:22,663 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-18 09:57:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:57:22,663 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-02-18 09:57:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:22,664 INFO L225 Difference]: With dead ends: 80 [2019-02-18 09:57:22,664 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:57:22,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:57:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:57:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-02-18 09:57:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-18 09:57:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-18 09:57:22,677 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-02-18 09:57:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:22,678 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-18 09:57:22,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:57:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-18 09:57:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-18 09:57:22,679 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:22,679 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-02-18 09:57:22,679 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-02-18 09:57:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:22,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:22,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:22,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:22,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:22,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:22,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:22,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:22,932 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-02-18 09:57:22,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:22,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:23,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-18 09:57:23,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:23,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:23,059 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-02-18 09:57:23,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:23,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:23,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:23,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:23,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:23,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-18 09:57:23,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:23,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:57:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:57:23,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:57:23,957 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-02-18 09:57:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:24,508 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-18 09:57:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:57:24,508 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-02-18 09:57:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:24,509 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:57:24,509 INFO L226 Difference]: Without dead ends: 84 [2019-02-18 09:57:24,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:57:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-18 09:57:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-02-18 09:57:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:57:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-18 09:57:24,524 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-02-18 09:57:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:24,524 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-18 09:57:24,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:57:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-18 09:57:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:57:24,525 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:24,525 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-02-18 09:57:24,526 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:24,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-02-18 09:57:24,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:24,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:24,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:24,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:24,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:24,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:24,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:24,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:24,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:24,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:24,862 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-02-18 09:57:24,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:24,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:24,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:24,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:24,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:24,942 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-02-18 09:57:24,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:24,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:24,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:26,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:27,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:27,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-18 09:57:27,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:27,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:57:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:57:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:57:27,252 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-02-18 09:57:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:27,867 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-18 09:57:27,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:57:27,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-02-18 09:57:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:27,868 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:57:27,868 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:57:27,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:57:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:57:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-02-18 09:57:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-18 09:57:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-18 09:57:27,882 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-02-18 09:57:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:27,883 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-18 09:57:27,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:57:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-18 09:57:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-18 09:57:27,884 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:27,884 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-02-18 09:57:27,884 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-02-18 09:57:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:27,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:27,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:28,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:28,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:28,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:28,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:28,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:28,349 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-02-18 09:57:28,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:28,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:28,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:28,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-02-18 09:57:28,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:28,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:28,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:28,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:29,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:29,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-18 09:57:29,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:29,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:57:29,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:57:29,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:57:29,345 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-02-18 09:57:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:29,964 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-18 09:57:29,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:57:29,965 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-02-18 09:57:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:29,965 INFO L225 Difference]: With dead ends: 95 [2019-02-18 09:57:29,966 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:57:29,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:57:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:57:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-02-18 09:57:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-18 09:57:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-18 09:57:29,978 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-02-18 09:57:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:29,978 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-18 09:57:29,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:57:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-18 09:57:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-18 09:57:29,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:29,979 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-02-18 09:57:29,980 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-02-18 09:57:29,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:29,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:29,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:29,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:29,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:30,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:30,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:30,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:30,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:30,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:30,386 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-02-18 09:57:30,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:30,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:30,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-18 09:57:30,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:30,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:30,499 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-02-18 09:57:30,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:30,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:30,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:30,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:31,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:31,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-18 09:57:31,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:31,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:57:31,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:57:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:57:31,593 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-02-18 09:57:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:32,311 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-18 09:57:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:57:32,311 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-02-18 09:57:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:32,312 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:57:32,312 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:57:32,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:57:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:57:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-02-18 09:57:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 09:57:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-18 09:57:32,325 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-02-18 09:57:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:32,325 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-18 09:57:32,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:57:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-18 09:57:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-18 09:57:32,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:32,326 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-02-18 09:57:32,327 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-02-18 09:57:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:32,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:32,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:32,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:32,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:32,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:32,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:32,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:32,716 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-02-18 09:57:32,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:32,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:32,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:32,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:32,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:32,801 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-02-18 09:57:32,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:32,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:32,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:33,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:34,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:34,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-18 09:57:34,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:34,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:57:34,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:57:34,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:57:34,053 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-02-18 09:57:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:34,775 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-18 09:57:34,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:57:34,775 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-02-18 09:57:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:34,776 INFO L225 Difference]: With dead ends: 105 [2019-02-18 09:57:34,776 INFO L226 Difference]: Without dead ends: 104 [2019-02-18 09:57:34,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:57:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-18 09:57:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-02-18 09:57:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:57:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-18 09:57:34,792 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-02-18 09:57:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:34,793 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-18 09:57:34,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:57:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-18 09:57:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:57:34,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:34,794 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-02-18 09:57:34,794 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-02-18 09:57:34,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:34,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:34,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:34,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:35,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:35,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:35,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:35,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:35,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:35,179 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-02-18 09:57:35,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:35,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:35,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:35,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-02-18 09:57:35,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:35,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-02-18 09:57:35,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:35,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:36,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:36,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-18 09:57:36,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:36,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:57:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:57:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:57:36,427 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-02-18 09:57:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:37,200 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-18 09:57:37,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:57:37,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-02-18 09:57:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:37,205 INFO L225 Difference]: With dead ends: 110 [2019-02-18 09:57:37,205 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:57:37,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:57:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:57:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-02-18 09:57:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-18 09:57:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-18 09:57:37,220 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-02-18 09:57:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:37,220 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-18 09:57:37,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:57:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-18 09:57:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-18 09:57:37,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:37,221 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-02-18 09:57:37,221 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-02-18 09:57:37,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:37,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:38,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:38,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:38,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:38,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:38,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:38,845 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-02-18 09:57:38,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:38,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:39,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-18 09:57:39,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:39,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:39,071 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-02-18 09:57:39,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:39,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:39,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:39,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:40,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-18 09:57:40,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:40,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:57:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:57:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:57:40,517 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-02-18 09:57:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:41,357 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-18 09:57:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:57:41,358 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-02-18 09:57:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:41,359 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:57:41,359 INFO L226 Difference]: Without dead ends: 114 [2019-02-18 09:57:41,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:57:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-18 09:57:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-02-18 09:57:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 09:57:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-18 09:57:41,373 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-02-18 09:57:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:41,374 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-18 09:57:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:57:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-18 09:57:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-18 09:57:41,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:41,375 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-02-18 09:57:41,375 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-02-18 09:57:41,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:41,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:41,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:41,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:41,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:41,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:41,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:41,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:41,970 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-02-18 09:57:41,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:41,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:42,052 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:42,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:42,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:42,079 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-02-18 09:57:42,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:42,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:42,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:42,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:43,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:43,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-18 09:57:43,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:43,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:57:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:57:43,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:57:43,341 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-02-18 09:57:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:44,405 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-18 09:57:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:57:44,405 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-02-18 09:57:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:44,407 INFO L225 Difference]: With dead ends: 120 [2019-02-18 09:57:44,407 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 09:57:44,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:57:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 09:57:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-02-18 09:57:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-18 09:57:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-18 09:57:44,428 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-02-18 09:57:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:44,429 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-18 09:57:44,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:57:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-18 09:57:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-18 09:57:44,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:44,430 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-02-18 09:57:44,430 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-02-18 09:57:44,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:44,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:44,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:44,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:44,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:44,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:44,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:44,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:44,979 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-02-18 09:57:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:44,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:45,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:45,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-02-18 09:57:45,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:45,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:45,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:45,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:46,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:46,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-18 09:57:46,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:46,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:57:46,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:57:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:57:46,399 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-02-18 09:57:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:47,507 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-02-18 09:57:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:57:47,508 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-02-18 09:57:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:47,509 INFO L225 Difference]: With dead ends: 125 [2019-02-18 09:57:47,509 INFO L226 Difference]: Without dead ends: 124 [2019-02-18 09:57:47,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:57:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-18 09:57:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-02-18 09:57:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-18 09:57:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-18 09:57:47,524 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-02-18 09:57:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:47,524 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-18 09:57:47,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:57:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-18 09:57:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-18 09:57:47,525 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:47,525 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-02-18 09:57:47,525 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-02-18 09:57:47,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:47,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:47,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:48,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:48,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:48,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:48,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:48,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:48,178 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-02-18 09:57:48,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:48,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:48,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-18 09:57:48,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:48,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:48,322 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-02-18 09:57:48,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:48,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-02-18 09:57:48,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:49,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:50,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:50,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-18 09:57:50,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:50,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:57:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:57:50,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:57:50,008 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-02-18 09:57:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:50,974 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-18 09:57:50,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:57:50,974 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-02-18 09:57:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:50,975 INFO L225 Difference]: With dead ends: 130 [2019-02-18 09:57:50,975 INFO L226 Difference]: Without dead ends: 129 [2019-02-18 09:57:50,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:57:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-18 09:57:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-02-18 09:57:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-18 09:57:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-18 09:57:50,993 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-02-18 09:57:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:50,993 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-18 09:57:50,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:57:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-18 09:57:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-18 09:57:50,994 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:50,994 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-02-18 09:57:50,994 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:50,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:50,994 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-02-18 09:57:50,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:50,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:50,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:50,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:50,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:51,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:51,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:51,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:51,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:51,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:51,622 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-02-18 09:57:51,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:51,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:51,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:51,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:51,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:51,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-02-18 09:57:51,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:51,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:51,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:52,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:53,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:53,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-18 09:57:53,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:53,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:57:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:57:53,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:57:53,257 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-02-18 09:57:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:54,500 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-18 09:57:54,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:57:54,501 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-02-18 09:57:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:54,502 INFO L225 Difference]: With dead ends: 135 [2019-02-18 09:57:54,502 INFO L226 Difference]: Without dead ends: 134 [2019-02-18 09:57:54,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:57:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-18 09:57:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-02-18 09:57:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-18 09:57:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-02-18 09:57:54,520 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-02-18 09:57:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:54,520 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-02-18 09:57:54,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:57:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-02-18 09:57:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-18 09:57:54,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:54,521 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-02-18 09:57:54,521 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-02-18 09:57:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:54,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:54,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:55,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:55,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:55,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:55,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:55,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:55,699 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-02-18 09:57:55,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:55,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:55,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:55,809 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-02-18 09:57:55,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:55,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:55,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:57:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:56,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:57,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:57,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-18 09:57:57,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:57,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-18 09:57:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-18 09:57:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-02-18 09:57:57,442 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-02-18 09:57:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:58,554 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-02-18 09:57:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:57:58,554 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-02-18 09:57:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:58,555 INFO L225 Difference]: With dead ends: 140 [2019-02-18 09:57:58,555 INFO L226 Difference]: Without dead ends: 139 [2019-02-18 09:57:58,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:57:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-18 09:57:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-02-18 09:57:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-18 09:57:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-18 09:57:58,577 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-02-18 09:57:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:58,577 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-18 09:57:58,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-18 09:57:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-18 09:57:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-18 09:57:58,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:58,578 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-02-18 09:57:58,579 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:57:58,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:58,579 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-02-18 09:57:58,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:58,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:58,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:58,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:58,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:59,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:59,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:59,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:59,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:59,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:59,329 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-02-18 09:57:59,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:59,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:59,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-18 09:57:59,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:59,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:59,503 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-02-18 09:57:59,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:59,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:59,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:01,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:02,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:02,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-18 09:58:02,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:02,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-18 09:58:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-18 09:58:02,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:58:02,513 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-02-18 09:58:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:03,651 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-02-18 09:58:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:58:03,652 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-02-18 09:58:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:03,653 INFO L225 Difference]: With dead ends: 145 [2019-02-18 09:58:03,653 INFO L226 Difference]: Without dead ends: 144 [2019-02-18 09:58:03,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:58:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-02-18 09:58:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-02-18 09:58:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-18 09:58:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-18 09:58:03,673 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-02-18 09:58:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:03,674 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-18 09:58:03,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-18 09:58:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-18 09:58:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-18 09:58:03,675 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:03,675 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-02-18 09:58:03,675 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:03,676 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-02-18 09:58:03,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:03,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:03,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:03,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:04,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:04,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:04,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:04,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:04,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:04,600 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-02-18 09:58:04,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:04,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:04,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:04,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:04,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:04,721 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-02-18 09:58:04,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:04,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:04,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:05,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:06,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:06,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-18 09:58:06,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:06,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-18 09:58:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-18 09:58:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:58:06,875 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-02-18 09:58:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:08,107 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-02-18 09:58:08,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:58:08,107 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-02-18 09:58:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:08,108 INFO L225 Difference]: With dead ends: 150 [2019-02-18 09:58:08,108 INFO L226 Difference]: Without dead ends: 149 [2019-02-18 09:58:08,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:58:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-18 09:58:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-02-18 09:58:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-02-18 09:58:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-02-18 09:58:08,131 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-02-18 09:58:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:08,131 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-02-18 09:58:08,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-18 09:58:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-02-18 09:58:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-02-18 09:58:08,132 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:08,132 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-02-18 09:58:08,133 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-02-18 09:58:08,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:08,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:08,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:09,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:09,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:09,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:09,800 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-02-18 09:58:09,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:09,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:09,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:09,917 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-02-18 09:58:09,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:09,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:09,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:10,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:11,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:11,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-18 09:58:11,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:11,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-18 09:58:11,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-18 09:58:11,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:58:11,905 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-02-18 09:58:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:13,117 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-18 09:58:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:58:13,117 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-02-18 09:58:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:13,118 INFO L225 Difference]: With dead ends: 155 [2019-02-18 09:58:13,118 INFO L226 Difference]: Without dead ends: 154 [2019-02-18 09:58:13,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:58:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-18 09:58:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-02-18 09:58:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-18 09:58:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-02-18 09:58:13,139 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-02-18 09:58:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:13,139 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-02-18 09:58:13,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-18 09:58:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-02-18 09:58:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-18 09:58:13,140 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:13,140 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-02-18 09:58:13,140 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:13,140 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-02-18 09:58:13,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:13,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:13,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:13,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:13,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:14,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:14,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:14,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:14,204 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-02-18 09:58:14,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:14,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:14,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-18 09:58:14,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:14,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:14,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-02-18 09:58:14,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:14,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:14,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:15,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:16,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:16,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-18 09:58:16,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:16,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-18 09:58:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-18 09:58:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:58:16,958 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-02-18 09:58:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:18,282 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-02-18 09:58:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:58:18,283 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-02-18 09:58:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:18,284 INFO L225 Difference]: With dead ends: 160 [2019-02-18 09:58:18,284 INFO L226 Difference]: Without dead ends: 159 [2019-02-18 09:58:18,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:58:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-18 09:58:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-02-18 09:58:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-02-18 09:58:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-02-18 09:58:18,310 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-02-18 09:58:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:18,310 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-02-18 09:58:18,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-18 09:58:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-02-18 09:58:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-02-18 09:58:18,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:18,312 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-02-18 09:58:18,312 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-02-18 09:58:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:18,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:18,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:19,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:19,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:19,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:19,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:19,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:19,208 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-02-18 09:58:19,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:19,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:19,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:19,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:19,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:19,336 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-02-18 09:58:19,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:19,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:19,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:20,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:21,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:21,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-18 09:58:21,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:21,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-18 09:58:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-18 09:58:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:58:21,765 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-02-18 09:58:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:23,226 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-02-18 09:58:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:58:23,226 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-02-18 09:58:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:23,227 INFO L225 Difference]: With dead ends: 165 [2019-02-18 09:58:23,227 INFO L226 Difference]: Without dead ends: 164 [2019-02-18 09:58:23,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:58:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-18 09:58:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-02-18 09:58:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-18 09:58:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-18 09:58:23,252 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-02-18 09:58:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:23,252 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-18 09:58:23,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-18 09:58:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-18 09:58:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-18 09:58:23,254 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:23,254 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-02-18 09:58:23,254 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:23,254 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-02-18 09:58:23,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:23,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:23,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:23,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:23,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:24,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:24,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:24,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:24,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:24,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:24,081 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-02-18 09:58:24,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:24,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:24,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:24,194 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-02-18 09:58:24,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:24,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:24,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:25,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:26,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:26,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-18 09:58:26,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:26,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-18 09:58:26,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-18 09:58:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 09:58:26,754 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-02-18 09:58:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:28,606 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-02-18 09:58:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:58:28,606 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-02-18 09:58:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:28,608 INFO L225 Difference]: With dead ends: 170 [2019-02-18 09:58:28,608 INFO L226 Difference]: Without dead ends: 169 [2019-02-18 09:58:28,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:58:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-18 09:58:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-02-18 09:58:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-02-18 09:58:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-02-18 09:58:28,638 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-02-18 09:58:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:28,638 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-02-18 09:58:28,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-18 09:58:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-02-18 09:58:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-02-18 09:58:28,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:28,640 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-02-18 09:58:28,640 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-02-18 09:58:28,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:28,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:28,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:30,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:30,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:30,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:30,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:30,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:30,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 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-02-18 09:58:30,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:30,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:30,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-18 09:58:30,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:30,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:30,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-02-18 09:58:30,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:30,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-02-18 09:58:30,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:31,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:32,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:32,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-18 09:58:32,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:32,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-18 09:58:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-18 09:58:32,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:58:32,847 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-02-18 09:58:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:34,352 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-18 09:58:34,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:58:34,352 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-02-18 09:58:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:34,353 INFO L225 Difference]: With dead ends: 175 [2019-02-18 09:58:34,353 INFO L226 Difference]: Without dead ends: 174 [2019-02-18 09:58:34,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:58:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-18 09:58:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-02-18 09:58:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-18 09:58:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-02-18 09:58:34,392 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-02-18 09:58:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:34,393 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-02-18 09:58:34,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-18 09:58:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-02-18 09:58:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-18 09:58:34,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:34,394 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-02-18 09:58:34,394 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-02-18 09:58:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:34,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:34,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:35,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:35,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:35,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:35,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:35,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:35,567 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-02-18 09:58:35,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:35,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:35,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:35,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:35,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:35,711 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-02-18 09:58:35,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:35,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:35,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:36,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:38,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:38,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-18 09:58:38,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:38,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-18 09:58:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-18 09:58:38,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 09:58:38,385 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-02-18 09:58:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:40,049 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-02-18 09:58:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:58:40,049 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-02-18 09:58:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:40,050 INFO L225 Difference]: With dead ends: 180 [2019-02-18 09:58:40,050 INFO L226 Difference]: Without dead ends: 179 [2019-02-18 09:58:40,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:58:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-18 09:58:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-02-18 09:58:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-02-18 09:58:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-02-18 09:58:40,081 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-02-18 09:58:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:40,081 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-02-18 09:58:40,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-18 09:58:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-02-18 09:58:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-02-18 09:58:40,082 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:40,082 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-02-18 09:58:40,083 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-02-18 09:58:40,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:40,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:40,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:40,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:40,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:40,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:40,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:40,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:40,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:58:40,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:40,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:41,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:41,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-02-18 09:58:41,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:41,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:41,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:42,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:43,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:43,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-18 09:58:43,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:43,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:58:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:58:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:58:43,885 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-02-18 09:58:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:45,885 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-02-18 09:58:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:58:45,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-02-18 09:58:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:45,889 INFO L225 Difference]: With dead ends: 185 [2019-02-18 09:58:45,889 INFO L226 Difference]: Without dead ends: 184 [2019-02-18 09:58:45,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:58:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-18 09:58:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-02-18 09:58:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-18 09:58:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-18 09:58:45,927 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-02-18 09:58:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:45,927 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-18 09:58:45,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:58:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-18 09:58:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-18 09:58:45,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:45,929 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-02-18 09:58:45,929 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-02-18 09:58:45,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:45,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:45,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:46,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:46,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:46,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:46,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:46,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:46,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 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-02-18 09:58:46,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:46,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:47,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-18 09:58:47,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:47,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:47,225 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-02-18 09:58:47,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:47,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:47,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:48,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:50,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:50,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-18 09:58:50,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:50,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-18 09:58:50,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-18 09:58:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 09:58:50,611 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-02-18 09:58:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:52,272 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-02-18 09:58:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:58:52,272 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-02-18 09:58:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:52,273 INFO L225 Difference]: With dead ends: 190 [2019-02-18 09:58:52,273 INFO L226 Difference]: Without dead ends: 189 [2019-02-18 09:58:52,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:58:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-18 09:58:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-02-18 09:58:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-18 09:58:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-02-18 09:58:52,312 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-02-18 09:58:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:52,312 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-02-18 09:58:52,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-18 09:58:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-02-18 09:58:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-02-18 09:58:52,313 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:52,314 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-02-18 09:58:52,314 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-02-18 09:58:52,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:52,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:52,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:53,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:53,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:53,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:53,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:53,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:53,194 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-02-18 09:58:53,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:53,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:53,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:53,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:53,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:53,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:58:53,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:53,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:53,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:58:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:55,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:57,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:57,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-18 09:58:57,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:57,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-18 09:58:57,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-18 09:58:57,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:58:57,970 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-02-18 09:58:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:59,768 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-18 09:58:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:58:59,768 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-02-18 09:58:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:59,769 INFO L225 Difference]: With dead ends: 195 [2019-02-18 09:58:59,769 INFO L226 Difference]: Without dead ends: 194 [2019-02-18 09:58:59,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:58:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-18 09:58:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-02-18 09:58:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-18 09:58:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-02-18 09:58:59,801 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-02-18 09:58:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:59,801 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-02-18 09:58:59,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-18 09:58:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-02-18 09:58:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-18 09:58:59,802 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:59,803 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-02-18 09:58:59,803 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:58:59,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-02-18 09:58:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:59,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:59,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:00,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:00,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:00,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:00,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:00,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:00,985 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-02-18 09:59:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:00,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:01,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:01,122 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-02-18 09:59:01,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:01,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:01,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:02,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:04,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:04,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-18 09:59:04,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:04,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:59:04,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:59:04,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:59:04,206 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-02-18 09:59:04,841 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:59:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:06,624 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-02-18 09:59:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:59:06,624 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-02-18 09:59:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:06,626 INFO L225 Difference]: With dead ends: 200 [2019-02-18 09:59:06,626 INFO L226 Difference]: Without dead ends: 199 [2019-02-18 09:59:06,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:59:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-18 09:59:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-02-18 09:59:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-18 09:59:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-02-18 09:59:06,667 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-02-18 09:59:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:06,667 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-02-18 09:59:06,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:59:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-02-18 09:59:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-18 09:59:06,668 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:06,668 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-02-18 09:59:06,668 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:59:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:06,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-02-18 09:59:06,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:06,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:06,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:06,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:06,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:07,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:07,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:07,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:07,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:07,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:07,829 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-02-18 09:59:07,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:07,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:08,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-18 09:59:08,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:08,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:08,117 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-02-18 09:59:08,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:08,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:08,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:09,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:11,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:11,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-18 09:59:11,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:11,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-18 09:59:11,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-18 09:59:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:59:11,519 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-02-18 09:59:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:13,421 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-02-18 09:59:13,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:59:13,421 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-02-18 09:59:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:13,422 INFO L225 Difference]: With dead ends: 205 [2019-02-18 09:59:13,422 INFO L226 Difference]: Without dead ends: 204 [2019-02-18 09:59:13,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:59:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-18 09:59:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-02-18 09:59:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-18 09:59:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-18 09:59:13,455 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-02-18 09:59:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:13,455 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-18 09:59:13,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-18 09:59:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-18 09:59:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-18 09:59:13,456 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:13,456 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-02-18 09:59:13,456 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:59:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:13,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-02-18 09:59:13,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:13,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:13,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:13,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:13,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:14,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:14,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:14,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:14,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:14,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:14,611 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-02-18 09:59:14,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:14,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:14,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:14,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:14,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:14,766 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-02-18 09:59:14,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:14,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:14,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:16,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:18,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:18,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-18 09:59:18,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:18,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-18 09:59:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-18 09:59:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-02-18 09:59:18,454 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-02-18 09:59:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:20,363 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-02-18 09:59:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:59:20,363 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-02-18 09:59:20,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:20,365 INFO L225 Difference]: With dead ends: 210 [2019-02-18 09:59:20,365 INFO L226 Difference]: Without dead ends: 209 [2019-02-18 09:59:20,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:59:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-18 09:59:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-02-18 09:59:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-18 09:59:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-02-18 09:59:20,399 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-02-18 09:59:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:20,400 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-02-18 09:59:20,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-18 09:59:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-02-18 09:59:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-18 09:59:20,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:20,401 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-02-18 09:59:20,401 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:59:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-02-18 09:59:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:20,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:20,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:21,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:21,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:21,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:21,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:21,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:21,724 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-02-18 09:59:21,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:21,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:21,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:21,880 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-02-18 09:59:21,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:21,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:21,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:23,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:25,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-18 09:59:25,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:25,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:59:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:59:25,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:59:25,555 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-02-18 09:59:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:27,788 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-18 09:59:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:59:27,788 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-02-18 09:59:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:27,789 INFO L225 Difference]: With dead ends: 215 [2019-02-18 09:59:27,789 INFO L226 Difference]: Without dead ends: 214 [2019-02-18 09:59:27,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:59:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-18 09:59:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-02-18 09:59:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-18 09:59:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-02-18 09:59:27,825 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-02-18 09:59:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:27,826 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-02-18 09:59:27,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:59:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-02-18 09:59:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-18 09:59:27,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:27,827 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-02-18 09:59:27,827 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:59:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-02-18 09:59:27,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:27,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:27,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:29,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:29,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:29,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:29,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:29,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:29,412 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-02-18 09:59:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:29,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:29,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-18 09:59:29,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:29,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:29,912 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-02-18 09:59:29,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:29,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:29,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:31,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:33,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:33,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-18 09:59:33,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:33,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-18 09:59:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-18 09:59:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-02-18 09:59:33,921 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-02-18 09:59:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:36,064 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-02-18 09:59:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:59:36,064 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-02-18 09:59:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:36,065 INFO L225 Difference]: With dead ends: 220 [2019-02-18 09:59:36,065 INFO L226 Difference]: Without dead ends: 219 [2019-02-18 09:59:36,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:59:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-02-18 09:59:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-02-18 09:59:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-02-18 09:59:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-02-18 09:59:36,103 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-02-18 09:59:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:36,103 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-02-18 09:59:36,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-18 09:59:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-02-18 09:59:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-02-18 09:59:36,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:36,104 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-02-18 09:59:36,105 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:59:36,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:36,105 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-02-18 09:59:36,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:36,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:36,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:36,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:36,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:37,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:37,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:37,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:37,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:37,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:37,548 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-02-18 09:59:37,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:37,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:37,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:37,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:37,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:37,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:59:37,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:37,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:37,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:39,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:42,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:42,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-18 09:59:42,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:42,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-18 09:59:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-18 09:59:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:59:42,005 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-02-18 09:59:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:44,233 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-02-18 09:59:44,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:59:44,233 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-02-18 09:59:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:44,234 INFO L225 Difference]: With dead ends: 225 [2019-02-18 09:59:44,235 INFO L226 Difference]: Without dead ends: 224 [2019-02-18 09:59:44,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:59:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-02-18 09:59:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-02-18 09:59:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-18 09:59:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-18 09:59:44,272 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-02-18 09:59:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:44,272 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-18 09:59:44,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-18 09:59:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-18 09:59:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-18 09:59:44,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:44,274 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-02-18 09:59:44,274 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:59:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-02-18 09:59:44,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:44,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:44,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:45,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:45,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:45,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:45,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:45,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:45,713 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-02-18 09:59:45,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:45,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:45,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:45,878 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-02-18 09:59:45,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:45,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-02-18 09:59:45,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:47,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:50,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:50,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-18 09:59:50,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:50,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:59:50,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:59:50,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-02-18 09:59:50,222 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-02-18 09:59:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:52,686 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-02-18 09:59:52,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:59:52,686 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-02-18 09:59:52,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:52,687 INFO L225 Difference]: With dead ends: 230 [2019-02-18 09:59:52,687 INFO L226 Difference]: Without dead ends: 229 [2019-02-18 09:59:52,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:59:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-02-18 09:59:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-02-18 09:59:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-18 09:59:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-02-18 09:59:52,737 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-02-18 09:59:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:52,737 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-02-18 09:59:52,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:59:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-02-18 09:59:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-02-18 09:59:52,738 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:52,738 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-02-18 09:59:52,739 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 09:59:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-02-18 09:59:52,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:52,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:52,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:53,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:53,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:53,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:53,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:53,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:53,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 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-02-18 09:59:53,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:53,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:54,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-18 09:59:54,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:54,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:54,273 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-02-18 09:59:54,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:54,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:54,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:59:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:55,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:59,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:59,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-18 09:59:59,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:59,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-18 09:59:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-18 09:59:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:59:59,055 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-02-18 10:00:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:01,573 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-18 10:00:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 10:00:01,574 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-02-18 10:00:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:01,575 INFO L225 Difference]: With dead ends: 235 [2019-02-18 10:00:01,575 INFO L226 Difference]: Without dead ends: 234 [2019-02-18 10:00:01,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:00:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-18 10:00:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-02-18 10:00:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-18 10:00:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-02-18 10:00:01,639 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-02-18 10:00:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:01,639 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-02-18 10:00:01,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-18 10:00:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-02-18 10:00:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-18 10:00:01,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:01,641 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-02-18 10:00:01,641 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:00:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-02-18 10:00:01,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:01,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:01,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:01,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:03,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:03,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:03,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:03,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:03,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:03,103 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-02-18 10:00:03,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:03,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:03,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:03,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:03,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:03,279 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-02-18 10:00:03,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:03,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:03,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:04,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:07,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:07,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-18 10:00:07,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:07,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-18 10:00:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-18 10:00:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-02-18 10:00:07,964 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-02-18 10:00:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:10,492 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-02-18 10:00:10,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 10:00:10,492 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-02-18 10:00:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:10,494 INFO L225 Difference]: With dead ends: 240 [2019-02-18 10:00:10,494 INFO L226 Difference]: Without dead ends: 239 [2019-02-18 10:00:10,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:00:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-18 10:00:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-02-18 10:00:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-18 10:00:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-02-18 10:00:10,557 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-02-18 10:00:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:10,557 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-02-18 10:00:10,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-18 10:00:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-02-18 10:00:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-02-18 10:00:10,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:10,559 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-02-18 10:00:10,559 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:00:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-02-18 10:00:10,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:10,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:10,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:10,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:10,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:11,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:11,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:11,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:11,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:11,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:11,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 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-02-18 10:00:11,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:11,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:11,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:11,980 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-02-18 10:00:11,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:12,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:12,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:13,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:17,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:17,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-18 10:00:17,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:17,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-18 10:00:17,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-18 10:00:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 10:00:17,047 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-02-18 10:00:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:19,867 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-02-18 10:00:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 10:00:19,876 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-02-18 10:00:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:19,877 INFO L225 Difference]: With dead ends: 245 [2019-02-18 10:00:19,877 INFO L226 Difference]: Without dead ends: 244 [2019-02-18 10:00:19,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:00:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-02-18 10:00:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-02-18 10:00:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-18 10:00:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-18 10:00:19,933 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-02-18 10:00:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:19,934 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-18 10:00:19,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-18 10:00:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-18 10:00:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-18 10:00:19,935 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:19,935 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-02-18 10:00:19,935 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:00:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-02-18 10:00:19,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:19,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:19,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:21,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:21,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:21,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:21,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:21,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:21,247 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-02-18 10:00:21,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:21,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:21,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-18 10:00:21,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:21,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:21,592 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-02-18 10:00:21,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:21,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:21,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:23,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:26,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:26,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-18 10:00:26,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:26,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-18 10:00:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-18 10:00:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-02-18 10:00:26,534 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-02-18 10:00:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:29,352 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-02-18 10:00:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 10:00:29,353 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-02-18 10:00:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:29,354 INFO L225 Difference]: With dead ends: 250 [2019-02-18 10:00:29,354 INFO L226 Difference]: Without dead ends: 249 [2019-02-18 10:00:29,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 10:00:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-18 10:00:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-02-18 10:00:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-02-18 10:00:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-02-18 10:00:29,400 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-02-18 10:00:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:29,400 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-02-18 10:00:29,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-18 10:00:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-02-18 10:00:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-02-18 10:00:29,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:29,401 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-02-18 10:00:29,401 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:00:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-02-18 10:00:29,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:29,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:29,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:29,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:29,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:30,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:30,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:30,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:30,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:30,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:30,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:00:30,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:30,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:30,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:30,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:30,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:30,925 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-02-18 10:00:30,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:30,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:30,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:32,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:36,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:36,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-18 10:00:36,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-18 10:00:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-18 10:00:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 10:00:36,048 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-02-18 10:00:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:38,955 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-18 10:00:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 10:00:38,956 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-02-18 10:00:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:38,957 INFO L225 Difference]: With dead ends: 255 [2019-02-18 10:00:38,957 INFO L226 Difference]: Without dead ends: 254 [2019-02-18 10:00:38,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:00:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-18 10:00:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-02-18 10:00:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-02-18 10:00:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-02-18 10:00:39,026 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-02-18 10:00:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:39,026 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-02-18 10:00:39,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-18 10:00:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-02-18 10:00:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-02-18 10:00:39,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:39,028 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-02-18 10:00:39,028 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:00:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-02-18 10:00:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:39,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:39,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:40,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:40,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:40,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:40,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:40,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:40,423 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-02-18 10:00:40,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:40,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:40,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:40,624 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-02-18 10:00:40,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:40,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:40,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:42,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:45,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:45,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-02-18 10:00:45,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:45,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-18 10:00:45,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-18 10:00:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-02-18 10:00:45,930 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-02-18 10:00:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:48,785 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-02-18 10:00:48,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 10:00:48,785 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-02-18 10:00:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:48,787 INFO L225 Difference]: With dead ends: 260 [2019-02-18 10:00:48,787 INFO L226 Difference]: Without dead ends: 259 [2019-02-18 10:00:48,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 10:00:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-18 10:00:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-02-18 10:00:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-02-18 10:00:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-02-18 10:00:48,855 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-02-18 10:00:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:48,856 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-02-18 10:00:48,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-18 10:00:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-02-18 10:00:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-02-18 10:00:48,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:48,858 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-02-18 10:00:48,858 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:00:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-02-18 10:00:48,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:48,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:48,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:48,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:48,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:50,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:50,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:50,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:50,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:50,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:50,596 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-02-18 10:00:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:50,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:50,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-18 10:00:50,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:50,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:50,969 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-02-18 10:00:50,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:50,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:50,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:00:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:52,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:56,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:56,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-02-18 10:00:56,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:56,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-18 10:00:56,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-18 10:00:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 10:00:56,515 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-02-18 10:01:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:00,458 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-02-18 10:01:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 10:01:00,459 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-02-18 10:01:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:00,460 INFO L225 Difference]: With dead ends: 265 [2019-02-18 10:01:00,460 INFO L226 Difference]: Without dead ends: 264 [2019-02-18 10:01:00,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 10:01:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-18 10:01:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-02-18 10:01:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-18 10:01:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-18 10:01:00,508 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-02-18 10:01:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:00,508 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-18 10:01:00,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-18 10:01:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-18 10:01:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-18 10:01:00,510 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:00,510 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-02-18 10:01:00,510 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:01:00,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-02-18 10:01:00,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:00,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:00,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:00,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:02,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:02,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:02,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:02,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:02,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:02,064 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-02-18 10:01:02,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:02,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:02,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:02,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:02,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:02,262 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-02-18 10:01:02,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:02,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:02,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:04,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:07,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:07,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-02-18 10:01:07,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:07,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-18 10:01:07,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-18 10:01:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 10:01:07,761 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-02-18 10:01:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:10,987 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-02-18 10:01:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 10:01:10,987 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-02-18 10:01:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:10,988 INFO L225 Difference]: With dead ends: 270 [2019-02-18 10:01:10,988 INFO L226 Difference]: Without dead ends: 269 [2019-02-18 10:01:10,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 10:01:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-18 10:01:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-02-18 10:01:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-02-18 10:01:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-02-18 10:01:11,049 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-02-18 10:01:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:11,049 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-02-18 10:01:11,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-18 10:01:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-02-18 10:01:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-02-18 10:01:11,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:11,050 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-02-18 10:01:11,050 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:01:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-02-18 10:01:11,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:11,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:11,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:12,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:12,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:12,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:12,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:12,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:12,629 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-02-18 10:01:12,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:12,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:12,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:12,819 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-02-18 10:01:12,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:12,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:12,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:14,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:18,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-02-18 10:01:18,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:18,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-18 10:01:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-18 10:01:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 10:01:18,627 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-02-18 10:01:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:21,711 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-18 10:01:21,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 10:01:21,711 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-02-18 10:01:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:21,713 INFO L225 Difference]: With dead ends: 275 [2019-02-18 10:01:21,713 INFO L226 Difference]: Without dead ends: 274 [2019-02-18 10:01:21,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-02-18 10:01:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-18 10:01:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-02-18 10:01:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-18 10:01:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-02-18 10:01:21,778 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-02-18 10:01:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:21,778 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-02-18 10:01:21,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-18 10:01:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-02-18 10:01:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-02-18 10:01:21,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:21,780 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-02-18 10:01:21,780 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:01:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-02-18 10:01:21,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:21,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:21,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:21,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:23,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:23,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:23,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:23,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:23,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:23,430 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-02-18 10:01:23,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:23,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:23,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-18 10:01:23,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:23,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:23,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-02-18 10:01:23,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:23,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-02-18 10:01:23,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:25,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:29,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:29,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-02-18 10:01:29,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:29,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-18 10:01:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-18 10:01:29,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-02-18 10:01:29,723 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-02-18 10:01:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:32,886 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-02-18 10:01:32,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 10:01:32,887 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-02-18 10:01:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:32,888 INFO L225 Difference]: With dead ends: 280 [2019-02-18 10:01:32,888 INFO L226 Difference]: Without dead ends: 279 [2019-02-18 10:01:32,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-02-18 10:01:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-18 10:01:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-02-18 10:01:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-18 10:01:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-02-18 10:01:32,956 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-02-18 10:01:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:32,956 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-02-18 10:01:32,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-18 10:01:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-02-18 10:01:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-18 10:01:32,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:32,958 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-02-18 10:01:32,959 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:01:32,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:32,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-02-18 10:01:32,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:32,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:32,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:32,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:32,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:34,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:34,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:34,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:34,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:34,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:34,874 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-02-18 10:01:34,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:34,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:35,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:35,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:35,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:35,074 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-02-18 10:01:35,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:35,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:35,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:37,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:41,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-02-18 10:01:41,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:41,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-18 10:01:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-18 10:01:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 10:01:41,013 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-02-18 10:01:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:44,244 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-02-18 10:01:44,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 10:01:44,245 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-02-18 10:01:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:44,246 INFO L225 Difference]: With dead ends: 285 [2019-02-18 10:01:44,246 INFO L226 Difference]: Without dead ends: 284 [2019-02-18 10:01:44,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-02-18 10:01:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-18 10:01:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-02-18 10:01:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-18 10:01:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-18 10:01:44,306 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-02-18 10:01:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:44,306 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-18 10:01:44,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-18 10:01:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-18 10:01:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-18 10:01:44,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:44,308 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-02-18 10:01:44,308 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:01:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-02-18 10:01:44,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:44,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:44,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:44,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:44,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:46,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:46,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:46,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:46,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:46,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:46,079 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-02-18 10:01:46,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:46,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:46,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:46,276 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-02-18 10:01:46,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:46,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:46,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:01:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:48,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:52,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:52,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-02-18 10:01:52,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:52,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-18 10:01:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-18 10:01:52,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-02-18 10:01:52,423 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-02-18 10:01:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:56,012 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-02-18 10:01:56,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 10:01:56,013 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-02-18 10:01:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:56,014 INFO L225 Difference]: With dead ends: 290 [2019-02-18 10:01:56,014 INFO L226 Difference]: Without dead ends: 289 [2019-02-18 10:01:56,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-02-18 10:01:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-18 10:01:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-02-18 10:01:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-02-18 10:01:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-02-18 10:01:56,073 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-02-18 10:01:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:56,073 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-02-18 10:01:56,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-18 10:01:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-02-18 10:01:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-02-18 10:01:56,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:56,074 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-02-18 10:01:56,074 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:01:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-02-18 10:01:56,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:56,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:56,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:57,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:57,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:57,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:57,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:57,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:57,854 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-02-18 10:01:57,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:57,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:58,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-18 10:01:58,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:58,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:58,359 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-02-18 10:01:58,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:58,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:58,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:00,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:04,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:04,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-02-18 10:02:04,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:04,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-18 10:02:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-18 10:02:04,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 10:02:04,757 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-02-18 10:02:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:08,307 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-18 10:02:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 10:02:08,308 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-02-18 10:02:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:08,309 INFO L225 Difference]: With dead ends: 295 [2019-02-18 10:02:08,309 INFO L226 Difference]: Without dead ends: 294 [2019-02-18 10:02:08,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-02-18 10:02:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-18 10:02:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-02-18 10:02:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-02-18 10:02:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-02-18 10:02:08,371 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-02-18 10:02:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:08,371 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-02-18 10:02:08,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-18 10:02:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-02-18 10:02:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-02-18 10:02:08,373 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:08,373 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-02-18 10:02:08,373 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:02:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-02-18 10:02:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:08,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:08,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:10,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:10,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:10,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:10,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:10,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:10,397 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-02-18 10:02:10,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:02:10,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:02:10,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:02:10,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:10,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:10,613 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-02-18 10:02:10,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:10,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:10,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:12,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:16,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:16,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-02-18 10:02:16,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:16,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-18 10:02:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-18 10:02:16,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 10:02:16,986 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-02-18 10:02:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:20,697 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-02-18 10:02:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 10:02:20,698 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-02-18 10:02:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:20,699 INFO L225 Difference]: With dead ends: 300 [2019-02-18 10:02:20,699 INFO L226 Difference]: Without dead ends: 299 [2019-02-18 10:02:20,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-02-18 10:02:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-02-18 10:02:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-02-18 10:02:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-02-18 10:02:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-02-18 10:02:20,771 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-02-18 10:02:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:20,771 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-02-18 10:02:20,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-18 10:02:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-02-18 10:02:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-02-18 10:02:20,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:20,773 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-02-18 10:02:20,773 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:02:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-02-18 10:02:20,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:20,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:20,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:22,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:22,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:22,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:22,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:22,748 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-02-18 10:02:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:22,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:22,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:22,952 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-02-18 10:02:22,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:22,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:22,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:25,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:29,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:29,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-02-18 10:02:29,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:29,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-18 10:02:29,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-18 10:02:29,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 10:02:29,546 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-02-18 10:02:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:33,466 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-02-18 10:02:33,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 10:02:33,467 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-02-18 10:02:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:33,468 INFO L225 Difference]: With dead ends: 305 [2019-02-18 10:02:33,468 INFO L226 Difference]: Without dead ends: 304 [2019-02-18 10:02:33,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-02-18 10:02:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-02-18 10:02:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-02-18 10:02:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-18 10:02:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-18 10:02:33,533 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-02-18 10:02:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:33,534 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-18 10:02:33,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-18 10:02:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-18 10:02:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-18 10:02:33,535 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:33,535 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-02-18 10:02:33,535 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:02:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-02-18 10:02:33,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:33,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:33,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:35,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:35,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:35,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:35,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:35,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:35,496 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-02-18 10:02:35,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:02:35,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:02:35,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-18 10:02:35,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:35,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:35,996 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-02-18 10:02:35,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:36,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:36,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:38,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:42,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:42,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-02-18 10:02:42,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:42,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-18 10:02:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-18 10:02:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-02-18 10:02:42,484 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-02-18 10:02:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:46,500 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-02-18 10:02:46,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 10:02:46,501 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-02-18 10:02:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:46,502 INFO L225 Difference]: With dead ends: 310 [2019-02-18 10:02:46,502 INFO L226 Difference]: Without dead ends: 309 [2019-02-18 10:02:46,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-02-18 10:02:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-02-18 10:02:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-02-18 10:02:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-02-18 10:02:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-02-18 10:02:46,568 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-02-18 10:02:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:46,568 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-02-18 10:02:46,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-18 10:02:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-02-18 10:02:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-02-18 10:02:46,569 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:46,570 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-02-18 10:02:46,570 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:02:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-02-18 10:02:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:46,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:46,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:48,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:48,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:48,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:48,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:48,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:48,505 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-02-18 10:02:48,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:02:48,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:02:48,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:02:48,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:48,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:48,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 10:02:48,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:48,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:48,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:02:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:51,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:55,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:55,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-02-18 10:02:55,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:55,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-18 10:02:55,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-18 10:02:55,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 10:02:55,289 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-02-18 10:02:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:59,321 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-18 10:02:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 10:02:59,322 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-02-18 10:02:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:59,323 INFO L225 Difference]: With dead ends: 315 [2019-02-18 10:02:59,323 INFO L226 Difference]: Without dead ends: 314 [2019-02-18 10:02:59,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-02-18 10:02:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-18 10:02:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-02-18 10:02:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-02-18 10:02:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-02-18 10:02:59,412 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-02-18 10:02:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:59,412 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-02-18 10:02:59,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-18 10:02:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-02-18 10:02:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-02-18 10:02:59,414 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:59,414 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-02-18 10:02:59,414 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:02:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-02-18 10:02:59,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:59,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:59,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:59,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:59,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:01,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:01,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:01,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:01,807 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-02-18 10:03:01,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:01,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:03:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:02,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:02,023 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-02-18 10:03:02,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:02,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:02,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:04,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:08,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:08,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-02-18 10:03:08,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:08,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-18 10:03:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-18 10:03:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-02-18 10:03:08,750 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-02-18 10:03:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:12,924 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-02-18 10:03:12,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 10:03:12,924 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-02-18 10:03:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:12,926 INFO L225 Difference]: With dead ends: 320 [2019-02-18 10:03:12,926 INFO L226 Difference]: Without dead ends: 319 [2019-02-18 10:03:12,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-02-18 10:03:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-02-18 10:03:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-02-18 10:03:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-02-18 10:03:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-02-18 10:03:12,999 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-02-18 10:03:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:12,999 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-02-18 10:03:12,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-18 10:03:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-02-18 10:03:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-02-18 10:03:13,001 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:13,001 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-02-18 10:03:13,001 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:03:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-02-18 10:03:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:13,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:13,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:15,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:15,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:15,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:15,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:15,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:15,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 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-02-18 10:03:15,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:03:15,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:03:15,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-18 10:03:15,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:15,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:15,800 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-02-18 10:03:15,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:15,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:15,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:18,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:22,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-02-18 10:03:22,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:22,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-18 10:03:22,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-18 10:03:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 10:03:22,795 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-02-18 10:03:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:26,953 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-02-18 10:03:26,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 10:03:26,953 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-02-18 10:03:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:26,954 INFO L225 Difference]: With dead ends: 325 [2019-02-18 10:03:26,955 INFO L226 Difference]: Without dead ends: 324 [2019-02-18 10:03:26,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-02-18 10:03:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-02-18 10:03:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-02-18 10:03:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-18 10:03:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-18 10:03:27,028 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-02-18 10:03:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:27,028 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-18 10:03:27,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-18 10:03:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-18 10:03:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-18 10:03:27,030 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:27,030 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-02-18 10:03:27,030 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:03:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-02-18 10:03:27,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:27,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:27,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:29,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:29,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:29,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:29,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:29,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:29,266 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-02-18 10:03:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:03:29,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:03:29,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:03:29,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:29,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:29,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-02-18 10:03:29,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:29,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:29,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:32,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:36,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:36,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-02-18 10:03:36,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:36,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-18 10:03:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-18 10:03:36,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 10:03:36,530 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-02-18 10:03:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:40,998 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-02-18 10:03:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 10:03:40,999 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-02-18 10:03:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:41,000 INFO L225 Difference]: With dead ends: 330 [2019-02-18 10:03:41,000 INFO L226 Difference]: Without dead ends: 329 [2019-02-18 10:03:41,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-02-18 10:03:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-02-18 10:03:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-02-18 10:03:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-02-18 10:03:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-02-18 10:03:41,088 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-02-18 10:03:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:41,088 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-02-18 10:03:41,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-18 10:03:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-02-18 10:03:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-02-18 10:03:41,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:41,089 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-02-18 10:03:41,089 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:03:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-02-18 10:03:41,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:41,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:41,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:43,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:43,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:43,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:43,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:43,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:43,586 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-02-18 10:03:43,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:43,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:03:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:43,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:43,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-02-18 10:03:43,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:43,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:43,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:03:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:46,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:50,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:50,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-02-18 10:03:50,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:50,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-18 10:03:50,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-18 10:03:50,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 10:03:50,826 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-02-18 10:03:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:55,329 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-18 10:03:55,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 10:03:55,329 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-02-18 10:03:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:55,330 INFO L225 Difference]: With dead ends: 335 [2019-02-18 10:03:55,330 INFO L226 Difference]: Without dead ends: 334 [2019-02-18 10:03:55,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-02-18 10:03:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-18 10:03:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-02-18 10:03:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-02-18 10:03:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-02-18 10:03:55,411 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-02-18 10:03:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:55,411 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-02-18 10:03:55,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-18 10:03:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-02-18 10:03:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-02-18 10:03:55,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:55,413 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-02-18 10:03:55,413 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:03:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-02-18 10:03:55,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:55,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:55,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:57,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:57,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:57,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:57,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:57,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:57,903 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-02-18 10:03:57,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:03:57,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:03:58,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-18 10:03:58,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:58,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:58,480 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-02-18 10:03:58,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:58,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:58,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:01,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:05,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:05,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-02-18 10:04:05,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:05,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-18 10:04:05,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-18 10:04:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-02-18 10:04:05,553 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-02-18 10:04:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:10,129 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-02-18 10:04:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 10:04:10,129 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-02-18 10:04:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:10,131 INFO L225 Difference]: With dead ends: 340 [2019-02-18 10:04:10,131 INFO L226 Difference]: Without dead ends: 339 [2019-02-18 10:04:10,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-02-18 10:04:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-02-18 10:04:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-02-18 10:04:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-02-18 10:04:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-02-18 10:04:10,214 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-02-18 10:04:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:10,214 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-02-18 10:04:10,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-18 10:04:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-02-18 10:04:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-02-18 10:04:10,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:10,216 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-02-18 10:04:10,216 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:04:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-02-18 10:04:10,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:10,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:10,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:10,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:12,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:12,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:12,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:12,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:12,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:12,652 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-02-18 10:04:12,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:04:12,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:04:12,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:04:12,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:12,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:12,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-02-18 10:04:12,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:12,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:12,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:15,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:20,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-02-18 10:04:20,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:20,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-18 10:04:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-18 10:04:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 10:04:20,054 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-02-18 10:04:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:24,740 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-02-18 10:04:24,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 10:04:24,741 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-02-18 10:04:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:24,742 INFO L225 Difference]: With dead ends: 345 [2019-02-18 10:04:24,742 INFO L226 Difference]: Without dead ends: 344 [2019-02-18 10:04:24,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-02-18 10:04:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-18 10:04:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-02-18 10:04:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-18 10:04:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-18 10:04:24,843 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-02-18 10:04:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:24,844 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-18 10:04:24,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-18 10:04:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-18 10:04:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-18 10:04:24,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:24,845 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-02-18 10:04:24,845 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:04:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-02-18 10:04:24,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:24,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:24,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:27,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:27,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:27,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:27,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:27,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:27,285 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-02-18 10:04:27,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:27,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:04:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:27,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:27,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 10:04:27,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:27,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:27,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:30,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:35,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:35,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-02-18 10:04:35,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:35,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-18 10:04:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-18 10:04:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-02-18 10:04:35,213 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-02-18 10:04:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:40,085 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-02-18 10:04:40,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 10:04:40,085 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-02-18 10:04:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:40,087 INFO L225 Difference]: With dead ends: 350 [2019-02-18 10:04:40,087 INFO L226 Difference]: Without dead ends: 349 [2019-02-18 10:04:40,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-02-18 10:04:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-02-18 10:04:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-02-18 10:04:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-02-18 10:04:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-02-18 10:04:40,175 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-02-18 10:04:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:40,175 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-02-18 10:04:40,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-18 10:04:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-02-18 10:04:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-02-18 10:04:40,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:40,177 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-02-18 10:04:40,177 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:04:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-02-18 10:04:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:40,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:40,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:42,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:42,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:42,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:42,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:42,705 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-02-18 10:04:42,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:42,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:04:43,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-18 10:04:43,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:43,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:43,329 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-02-18 10:04:43,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:43,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:43,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:04:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:46,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:50,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:50,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-02-18 10:04:50,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:50,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-18 10:04:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-18 10:04:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 10:04:50,967 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-02-18 10:04:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:55,830 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-18 10:04:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-18 10:04:55,830 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-02-18 10:04:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:55,832 INFO L225 Difference]: With dead ends: 355 [2019-02-18 10:04:55,832 INFO L226 Difference]: Without dead ends: 354 [2019-02-18 10:04:55,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-02-18 10:04:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-18 10:04:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-02-18 10:04:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-02-18 10:04:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-02-18 10:04:55,925 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-02-18 10:04:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:55,925 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-02-18 10:04:55,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-18 10:04:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-02-18 10:04:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-02-18 10:04:55,926 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:55,927 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-02-18 10:04:55,927 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:04:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-02-18 10:04:55,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:55,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:55,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:55,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:55,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:58,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:58,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:58,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:58,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:58,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:58,452 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-02-18 10:04:58,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:04:58,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:04:58,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:04:58,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:58,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:58,729 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-02-18 10:04:58,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:58,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:58,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:02,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:06,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-02-18 10:05:06,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:06,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-18 10:05:06,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-18 10:05:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 10:05:06,524 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-02-18 10:05:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:11,664 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-02-18 10:05:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-18 10:05:11,664 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-02-18 10:05:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:11,666 INFO L225 Difference]: With dead ends: 360 [2019-02-18 10:05:11,666 INFO L226 Difference]: Without dead ends: 359 [2019-02-18 10:05:11,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-02-18 10:05:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-02-18 10:05:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-02-18 10:05:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-02-18 10:05:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-02-18 10:05:11,755 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-02-18 10:05:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:11,756 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-02-18 10:05:11,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-18 10:05:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-02-18 10:05:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-02-18 10:05:11,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:11,757 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-02-18 10:05:11,758 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:05:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-02-18 10:05:11,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:11,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:11,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:14,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:14,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:14,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:14,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:14,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:14,479 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-02-18 10:05:14,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:05:14,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:05:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:14,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:14,723 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-02-18 10:05:14,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:14,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:14,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:17,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:22,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:22,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-02-18 10:05:22,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:22,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-18 10:05:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-18 10:05:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 10:05:22,439 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-02-18 10:05:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:27,571 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-02-18 10:05:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 10:05:27,571 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-02-18 10:05:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:27,573 INFO L225 Difference]: With dead ends: 365 [2019-02-18 10:05:27,573 INFO L226 Difference]: Without dead ends: 364 [2019-02-18 10:05:27,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-02-18 10:05:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-02-18 10:05:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-02-18 10:05:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-18 10:05:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-18 10:05:27,669 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-02-18 10:05:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:27,669 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-18 10:05:27,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-18 10:05:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-18 10:05:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-18 10:05:27,670 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:27,671 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-02-18 10:05:27,671 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:05:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-02-18 10:05:27,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:05:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:27,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:30,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:30,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:30,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:30,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:30,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:30,623 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-02-18 10:05:30,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:05:30,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:05:31,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-18 10:05:31,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:31,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:31,297 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-02-18 10:05:31,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:31,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:31,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:34,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:38,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:38,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-02-18 10:05:38,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:38,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-18 10:05:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-18 10:05:38,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-02-18 10:05:38,865 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-02-18 10:05:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:44,153 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-02-18 10:05:44,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 10:05:44,154 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-02-18 10:05:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:44,155 INFO L225 Difference]: With dead ends: 370 [2019-02-18 10:05:44,155 INFO L226 Difference]: Without dead ends: 369 [2019-02-18 10:05:44,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-02-18 10:05:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-02-18 10:05:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-02-18 10:05:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-18 10:05:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-02-18 10:05:44,251 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-02-18 10:05:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:44,251 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-02-18 10:05:44,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-18 10:05:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-02-18 10:05:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-02-18 10:05:44,253 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:44,253 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-02-18 10:05:44,253 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:05:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:44,253 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-02-18 10:05:44,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:44,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:44,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:47,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:47,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:47,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:47,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:47,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:47,200 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-02-18 10:05:47,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:05:47,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:05:47,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:05:47,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:47,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:47,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-02-18 10:05:47,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:47,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-02-18 10:05:47,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:05:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:51,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:55,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:55,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-02-18 10:05:55,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:55,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-18 10:05:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-18 10:05:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 10:05:55,742 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-02-18 10:06:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:01,120 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-18 10:06:01,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-18 10:06:01,121 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-02-18 10:06:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:01,122 INFO L225 Difference]: With dead ends: 375 [2019-02-18 10:06:01,122 INFO L226 Difference]: Without dead ends: 374 [2019-02-18 10:06:01,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-02-18 10:06:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-18 10:06:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-02-18 10:06:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-02-18 10:06:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-02-18 10:06:01,223 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-02-18 10:06:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:01,224 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-02-18 10:06:01,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-18 10:06:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-02-18 10:06:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-02-18 10:06:01,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:01,225 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-02-18 10:06:01,225 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:06:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-02-18 10:06:01,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:01,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:01,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:06:01,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:01,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:04,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:04,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:04,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:04,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:04,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:04,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:06:04,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:04,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:04,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:04,258 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-02-18 10:06:04,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:04,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:04,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:07,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:12,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:12,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-02-18 10:06:12,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:12,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-18 10:06:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-18 10:06:12,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-02-18 10:06:12,392 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-02-18 10:06:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:17,790 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-02-18 10:06:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-18 10:06:17,790 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-02-18 10:06:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:17,792 INFO L225 Difference]: With dead ends: 380 [2019-02-18 10:06:17,792 INFO L226 Difference]: Without dead ends: 379 [2019-02-18 10:06:17,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-02-18 10:06:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-02-18 10:06:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-02-18 10:06:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-02-18 10:06:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-02-18 10:06:17,897 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-02-18 10:06:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:17,897 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-02-18 10:06:17,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-18 10:06:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-02-18 10:06:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-02-18 10:06:17,898 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:17,899 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-02-18 10:06:17,899 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:06:17,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-02-18 10:06:17,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:17,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:17,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:20,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:20,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:20,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:20,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:20,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:20,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 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-02-18 10:06:20,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:06:20,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:06:21,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-18 10:06:21,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:06:21,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:21,336 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-02-18 10:06:21,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:21,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:21,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:24,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:29,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:29,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-02-18 10:06:29,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:29,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-18 10:06:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-18 10:06:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 10:06:29,314 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-02-18 10:06:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:34,863 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-02-18 10:06:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-18 10:06:34,863 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-02-18 10:06:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:34,865 INFO L225 Difference]: With dead ends: 385 [2019-02-18 10:06:34,865 INFO L226 Difference]: Without dead ends: 384 [2019-02-18 10:06:34,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-02-18 10:06:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-02-18 10:06:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-02-18 10:06:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-18 10:06:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-18 10:06:34,969 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-02-18 10:06:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:34,969 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-18 10:06:34,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-18 10:06:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-18 10:06:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-18 10:06:34,971 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:34,971 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-02-18 10:06:34,971 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:06:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-02-18 10:06:34,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:34,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:06:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:34,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:38,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:38,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:38,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:38,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:38,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:38,048 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-02-18 10:06:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:06:38,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:06:38,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:06:38,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:06:38,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:38,328 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-02-18 10:06:38,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:38,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-02-18 10:06:38,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:42,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:46,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:46,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-02-18 10:06:46,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:46,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-18 10:06:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-18 10:06:46,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 10:06:46,597 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-02-18 10:06:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:52,354 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-02-18 10:06:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 10:06:52,354 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-02-18 10:06:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:52,356 INFO L225 Difference]: With dead ends: 390 [2019-02-18 10:06:52,356 INFO L226 Difference]: Without dead ends: 389 [2019-02-18 10:06:52,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-02-18 10:06:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-02-18 10:06:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-02-18 10:06:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-02-18 10:06:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-02-18 10:06:52,466 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-02-18 10:06:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:52,466 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-02-18 10:06:52,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-18 10:06:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-02-18 10:06:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-02-18 10:06:52,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:52,468 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-02-18 10:06:52,468 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:06:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-02-18 10:06:52,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:52,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:52,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:06:52,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:52,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:55,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:55,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:55,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:55,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:55,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:55,412 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-02-18 10:06:55,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:55,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:55,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:55,678 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-02-18 10:06:55,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:55,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:55,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:06:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:59,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:04,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:04,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-02-18 10:07:04,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:04,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-18 10:07:04,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-18 10:07:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 10:07:04,086 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-02-18 10:07:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:10,094 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-18 10:07:10,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-18 10:07:10,094 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-02-18 10:07:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:10,096 INFO L225 Difference]: With dead ends: 395 [2019-02-18 10:07:10,096 INFO L226 Difference]: Without dead ends: 394 [2019-02-18 10:07:10,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-02-18 10:07:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-18 10:07:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-02-18 10:07:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-02-18 10:07:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-02-18 10:07:10,207 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-02-18 10:07:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:10,208 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-02-18 10:07:10,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-18 10:07:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-02-18 10:07:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-02-18 10:07:10,209 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:10,209 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-02-18 10:07:10,210 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:07:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-02-18 10:07:10,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:10,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:10,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:10,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:10,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:13,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:13,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:13,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:13,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:13,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:13,460 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-02-18 10:07:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:13,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:14,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-18 10:07:14,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:14,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:14,225 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-02-18 10:07:14,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:07:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:18,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:22,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:22,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-02-18 10:07:22,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:22,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-18 10:07:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-18 10:07:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-02-18 10:07:22,817 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-02-18 10:07:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:28,762 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-02-18 10:07:28,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-18 10:07:28,762 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-02-18 10:07:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:28,764 INFO L225 Difference]: With dead ends: 400 [2019-02-18 10:07:28,764 INFO L226 Difference]: Without dead ends: 399 [2019-02-18 10:07:28,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-02-18 10:07:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-02-18 10:07:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-02-18 10:07:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-02-18 10:07:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-02-18 10:07:28,876 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-02-18 10:07:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:28,876 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-02-18 10:07:28,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-18 10:07:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-02-18 10:07:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-02-18 10:07:28,877 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:28,878 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-02-18 10:07:28,878 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:07:28,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-02-18 10:07:28,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:28,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:28,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:31,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:31,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:31,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:31,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:31,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:31,853 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-02-18 10:07:31,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:07:31,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:07:32,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:07:32,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:32,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:32,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 10:07:32,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:07:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:36,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:40,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:40,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-02-18 10:07:40,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:40,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-18 10:07:40,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-18 10:07:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:07:40,670 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-02-18 10:07:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:46,644 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-02-18 10:07:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 10:07:46,644 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-02-18 10:07:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:46,646 INFO L225 Difference]: With dead ends: 405 [2019-02-18 10:07:46,646 INFO L226 Difference]: Without dead ends: 404 [2019-02-18 10:07:46,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-02-18 10:07:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-02-18 10:07:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-02-18 10:07:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-18 10:07:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-18 10:07:46,761 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-02-18 10:07:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:46,761 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-18 10:07:46,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-18 10:07:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-18 10:07:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-18 10:07:46,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:46,762 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-02-18 10:07:46,763 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:07:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-02-18 10:07:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:46,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:46,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:50,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:50,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:50,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:50,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:50,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:50,150 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-02-18 10:07:50,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:50,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:50,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:50,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 10:07:50,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:07:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:54,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:59,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-02-18 10:07:59,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:59,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-18 10:07:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-18 10:07:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-02-18 10:07:59,028 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-02-18 10:08:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:05,012 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-02-18 10:08:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-18 10:08:05,012 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-02-18 10:08:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:05,014 INFO L225 Difference]: With dead ends: 410 [2019-02-18 10:08:05,014 INFO L226 Difference]: Without dead ends: 409 [2019-02-18 10:08:05,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-02-18 10:08:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-02-18 10:08:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-02-18 10:08:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-02-18 10:08:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-02-18 10:08:05,135 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-02-18 10:08:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:05,136 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-02-18 10:08:05,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-18 10:08:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-02-18 10:08:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-02-18 10:08:05,137 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:05,137 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-02-18 10:08:05,138 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:08:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-02-18 10:08:05,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:05,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:08,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:08,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:08,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:08,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:08,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:08,310 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-02-18 10:08:08,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:08:08,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:08:09,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-18 10:08:09,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:09,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:09,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-02-18 10:08:09,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:08:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:12,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:17,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:17,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-02-18 10:08:17,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:17,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-18 10:08:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-18 10:08:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:08:17,373 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-02-18 10:08:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:23,778 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-02-18 10:08:23,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-18 10:08:23,778 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-02-18 10:08:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:23,780 INFO L225 Difference]: With dead ends: 415 [2019-02-18 10:08:23,780 INFO L226 Difference]: Without dead ends: 414 [2019-02-18 10:08:23,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-02-18 10:08:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-02-18 10:08:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-02-18 10:08:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-02-18 10:08:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-02-18 10:08:23,902 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-02-18 10:08:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:23,902 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-02-18 10:08:23,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-18 10:08:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-02-18 10:08:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-02-18 10:08:23,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:23,904 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-02-18 10:08:23,904 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-18 10:08:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:23,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-02-18 10:08:23,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:23,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:23,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:27,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:27,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:27,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:27,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:27,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:27,126 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-02-18 10:08:27,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:08:27,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:08:27,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:08:27,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:27,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:27,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 10:08:27,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:27,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:27,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 10:08:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:31,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:36,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-02-18 10:08:36,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:36,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-18 10:08:36,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-18 10:08:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 10:08:36,412 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states.