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-1ae3202 [2019-03-04 16:53:02,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:02,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:02,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:02,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:02,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:02,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:02,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:02,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:02,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:02,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:02,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:02,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:02,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:02,709 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:02,710 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:02,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:02,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:02,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:02,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:02,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:02,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:02,730 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:02,731 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:02,731 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:02,732 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:02,734 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:02,735 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:02,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:02,737 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:02,737 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:02,738 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:02,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:02,739 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:02,740 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:02,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:02,742 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-03-04 16:53:02,760 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:02,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:02,761 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:02,761 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:02,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:02,762 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:02,762 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:02,762 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:02,762 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:02,762 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:02,763 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:02,763 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:02,763 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:02,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:02,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:02,764 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:02,764 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:02,764 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:02,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:02,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:02,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:02,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:02,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:02,765 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:02,766 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:02,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:02,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:02,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:02,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:02,767 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:02,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:02,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:02,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:02,767 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:02,768 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:02,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:02,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:02,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:02,768 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:02,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:02,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:02,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:02,836 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:02,837 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:02,838 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-03-04 16:53:02,838 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-03-04 16:53:02,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:02,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:02,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:02,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:02,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:02,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,927 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:53:02,927 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:53:02,928 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:53:02,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:02,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:02,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:02,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:02,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:02,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:02,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:02,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:02,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-03-04 16:53:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:53:03,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:53:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-03-04 16:53:03,434 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:53:03,435 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-03-04 16:53:03,436 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:03 BoogieIcfgContainer [2019-03-04 16:53:03,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:03,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:03,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:03,441 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:03,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/2) ... [2019-03-04 16:53:03,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d96b94 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:03, skipping insertion in model container [2019-03-04 16:53:03,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:03" (2/2) ... [2019-03-04 16:53:03,444 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-03-04 16:53:03,452 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:03,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-03-04 16:53:03,477 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-03-04 16:53:03,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:03,517 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:03,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:03,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:03,518 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:03,518 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:03,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:03,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-03-04 16:53:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:03,537 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:03,541 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,547 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-03-04 16:53:03,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:03,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:53:03,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:03,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:03,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:03,773 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-03-04 16:53:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:03,887 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-03-04 16:53:03,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:03,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:53:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:03,899 INFO L225 Difference]: With dead ends: 20 [2019-03-04 16:53:03,899 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:53:03,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:53:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-03-04 16:53:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:53:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-03-04 16:53:03,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-03-04 16:53:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:03,936 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-03-04 16:53:03,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-03-04 16:53:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:03,937 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:53:03,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:03,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-03-04 16:53:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:04,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:53:04,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:04,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:53:04,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:53:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:04,269 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-03-04 16:53:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:04,496 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-03-04 16:53:04,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:04,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-03-04 16:53:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:04,501 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:53:04,501 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:53:04,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:53:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:53:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-03-04 16:53:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:53:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-03-04 16:53:04,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-03-04 16:53:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:04,519 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-03-04 16:53:04,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:53:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-03-04 16:53:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:53:04,520 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:04,520 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:53:04,521 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-03-04 16:53:04,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:04,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:04,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:04,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:53:04,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:04,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:04,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:04,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:04,573 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-03-04 16:53:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:04,585 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-03-04 16:53:04,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:04,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-03-04 16:53:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:04,586 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:53:04,587 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:53:04,587 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-03-04 16:53:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:53:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-03-04 16:53:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:53:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-03-04 16:53:04,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-03-04 16:53:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:04,592 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-03-04 16:53:04,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-03-04 16:53:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:53:04,593 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:04,593 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-03-04 16:53:04,593 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-03-04 16:53:04,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:04,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:04,789 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 16:53:04,792 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-03-04 16:53:04,867 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:04,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:35,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:35,760 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-03-04 16:53:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:35,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:35,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:53:35,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:35,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:35,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:53:35,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:35,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:35,926 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:35,939 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:35,939 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:36,153 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:36,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:36,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:36,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:36,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:36,347 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-03-04 16:53:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:36,697 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-03-04 16:53:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:53:36,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-03-04 16:53:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:36,699 INFO L225 Difference]: With dead ends: 20 [2019-03-04 16:53:36,699 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:53:36,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:53:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-03-04 16:53:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:53:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-03-04 16:53:36,709 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-03-04 16:53:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:36,709 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-03-04 16:53:36,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-03-04 16:53:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-03-04 16:53:36,710 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:36,710 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-03-04 16:53:36,711 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-03-04 16:53:36,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:36,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:36,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:36,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:36,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:36,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:36,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:36,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:36,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:36,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:36,921 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-03-04 16:53:36,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:36,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:36,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:53:36,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:36,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2019-03-04 16:53:36,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:36,978 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:36,979 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,987 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,987 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:37,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:53:37,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:37,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:53:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:53:37,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:37,186 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-03-04 16:53:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:37,407 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-03-04 16:53:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:53:37,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-03-04 16:53:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:37,410 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:53:37,410 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:53:37,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:53:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:53:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-03-04 16:53:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:53:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-03-04 16:53:37,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-03-04 16:53:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:37,416 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-03-04 16:53:37,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:53:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-03-04 16:53:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-03-04 16:53:37,417 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:37,417 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-03-04 16:53:37,418 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-03-04 16:53:37,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:37,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:37,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:37,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:37,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:37,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:37,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:37,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:37,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:37,711 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-03-04 16:53:37,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:37,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:37,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:37,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:37,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 28 conjunts are in the unsatisfiable core [2019-03-04 16:53:37,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:37,821 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:37,821 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:37,921 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:37,922 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:38,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:53:38,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:38,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:53:38,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:53:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:38,528 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-03-04 16:53:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:38,764 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-03-04 16:53:38,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:53:38,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-03-04 16:53:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:38,767 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:53:38,768 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:53:38,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:53:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:53:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-03-04 16:53:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:53:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-03-04 16:53:38,773 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-03-04 16:53:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:38,774 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-03-04 16:53:38,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:53:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-03-04 16:53:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-03-04 16:53:38,775 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:38,775 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-03-04 16:53:38,775 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:38,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-03-04 16:53:38,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:38,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:38,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:38,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:38,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:38,898 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-03-04 16:53:38,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:38,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:38,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2019-03-04 16:53:38,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:38,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:38,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:38,996 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:38,997 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:39,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:53:39,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:39,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:53:39,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:53:39,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:53:39,292 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-03-04 16:53:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:39,522 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-03-04 16:53:39,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:53:39,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-03-04 16:53:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:39,524 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:53:39,524 INFO L226 Difference]: Without dead ends: 34 [2019-03-04 16:53:39,525 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-03-04 16:53:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-03-04 16:53:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-03-04 16:53:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:53:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-03-04 16:53:39,532 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-03-04 16:53:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:39,532 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-03-04 16:53:39,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:53:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-03-04 16:53:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:53:39,533 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:39,533 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-03-04 16:53:39,534 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-03-04 16:53:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:39,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:39,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:39,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:39,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:39,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,673 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-03-04 16:53:39,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:39,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:39,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-03-04 16:53:39,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:39,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:53:39,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:39,729 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:39,730 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,737 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,738 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:40,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-03-04 16:53:40,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:40,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:53:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:53:40,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:53:40,006 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-03-04 16:53:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:40,510 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-03-04 16:53:40,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:53:40,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-03-04 16:53:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:40,511 INFO L225 Difference]: With dead ends: 40 [2019-03-04 16:53:40,511 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:53:40,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:53:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:53:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-03-04 16:53:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:53:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-03-04 16:53:40,519 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-03-04 16:53:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:40,519 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-03-04 16:53:40,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:53:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-03-04 16:53:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-03-04 16:53:40,521 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:40,521 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-03-04 16:53:40,521 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-03-04 16:53:40,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:40,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:40,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:40,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:40,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:40,794 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-03-04 16:53:40,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:40,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:40,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:40,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:40,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 37 conjunts are in the unsatisfiable core [2019-03-04 16:53:40,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:40,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:40,840 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,850 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:41,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-03-04 16:53:41,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:41,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:53:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:53:41,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:53:41,184 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-03-04 16:53:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:41,477 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-03-04 16:53:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:53:41,477 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-03-04 16:53:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:41,479 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:53:41,479 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:53:41,480 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-03-04 16:53:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:53:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-03-04 16:53:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:53:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-03-04 16:53:41,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-03-04 16:53:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:41,487 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-03-04 16:53:41,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:53:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-03-04 16:53:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-03-04 16:53:41,488 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:41,488 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-03-04 16:53:41,489 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-03-04 16:53:41,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:41,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:41,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:41,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:41,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:41,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:41,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:41,696 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-03-04 16:53:41,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:41,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:41,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 38 conjunts are in the unsatisfiable core [2019-03-04 16:53:41,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:41,762 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:41,762 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:41,772 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:41,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:42,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:42,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-03-04 16:53:42,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:42,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:53:42,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:53:42,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:53:42,107 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-03-04 16:53:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:42,436 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-03-04 16:53:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:53:42,437 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-03-04 16:53:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:42,438 INFO L225 Difference]: With dead ends: 50 [2019-03-04 16:53:42,438 INFO L226 Difference]: Without dead ends: 49 [2019-03-04 16:53:42,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-03-04 16:53:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-03-04 16:53:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:53:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-03-04 16:53:42,447 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-03-04 16:53:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:42,448 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-03-04 16:53:42,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:53:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-03-04 16:53:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-03-04 16:53:42,449 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:42,449 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-03-04 16:53:42,449 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:42,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-03-04 16:53:42,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:42,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:42,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:42,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:42,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:42,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:42,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:53:42,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:42,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:42,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-03-04 16:53:42,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:42,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjunts are in the unsatisfiable core [2019-03-04 16:53:43,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:43,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:43,011 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,019 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:43,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:43,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:43,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-03-04 16:53:43,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:43,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-03-04 16:53:43,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-03-04 16:53:43,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:53:43,445 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-03-04 16:53:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:43,756 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-03-04 16:53:43,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:53:43,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-03-04 16:53:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:43,758 INFO L225 Difference]: With dead ends: 55 [2019-03-04 16:53:43,758 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:53:43,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-03-04 16:53:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:53:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-03-04 16:53:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:53:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-03-04 16:53:43,767 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-03-04 16:53:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:43,767 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-03-04 16:53:43,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-03-04 16:53:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-03-04 16:53:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-03-04 16:53:43,768 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:43,768 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-03-04 16:53:43,769 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-03-04 16:53:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:43,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:43,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:44,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:44,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:44,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:44,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:44,100 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-03-04 16:53:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:44,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:44,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:44,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:44,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2019-03-04 16:53:44,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:44,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:44,160 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,170 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:44,171 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:44,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-03-04 16:53:44,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:44,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-03-04 16:53:44,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-03-04 16:53:44,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:53:44,723 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-03-04 16:53:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:45,156 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-03-04 16:53:45,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:53:45,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-03-04 16:53:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:45,159 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:53:45,159 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:53:45,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-03-04 16:53:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:53:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-03-04 16:53:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:53:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-03-04 16:53:45,168 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-03-04 16:53:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:45,169 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-03-04 16:53:45,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-03-04 16:53:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-03-04 16:53:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-03-04 16:53:45,170 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:45,170 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-03-04 16:53:45,170 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:45,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-03-04 16:53:45,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:45,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:45,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:45,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:45,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:45,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,908 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-03-04 16:53:45,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:45,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:45,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 47 conjunts are in the unsatisfiable core [2019-03-04 16:53:45,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:45,970 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:45,970 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,980 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,980 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:46,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-03-04 16:53:46,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:46,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:53:46,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:53:46,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:46,518 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-03-04 16:53:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:46,904 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-03-04 16:53:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:53:46,905 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-03-04 16:53:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:46,906 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:53:46,906 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:53:46,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:53:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:53:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-03-04 16:53:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:53:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-03-04 16:53:46,917 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-03-04 16:53:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:46,917 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-03-04 16:53:46,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:53:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-03-04 16:53:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-03-04 16:53:46,918 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:46,919 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-03-04 16:53:46,919 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-03-04 16:53:46,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:46,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:46,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:47,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:47,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:47,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:47,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:47,278 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-03-04 16:53:47,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:47,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:47,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-03-04 16:53:47,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:47,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:53:47,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:47,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:47,378 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,386 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,386 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:47,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-03-04 16:53:47,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:47,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-03-04 16:53:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-03-04 16:53:47,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:53:47,902 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-03-04 16:53:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:48,693 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-03-04 16:53:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:53:48,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-03-04 16:53:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:48,694 INFO L225 Difference]: With dead ends: 70 [2019-03-04 16:53:48,695 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:53:48,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-03-04 16:53:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:53:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-03-04 16:53:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:53:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-03-04 16:53:48,709 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-03-04 16:53:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:48,709 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-03-04 16:53:48,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-03-04 16:53:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-03-04 16:53:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-03-04 16:53:48,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:48,711 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-03-04 16:53:48,711 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-03-04 16:53:48,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:48,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:48,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:48,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:48,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:49,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:49,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:49,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:49,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:49,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:49,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 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-03-04 16:53:49,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:49,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:49,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:49,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:49,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:53:49,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:49,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:49,217 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,227 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,227 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:49,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:49,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:49,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-03-04 16:53:49,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:49,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-03-04 16:53:49,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-03-04 16:53:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:53:49,939 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-03-04 16:53:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:50,524 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-03-04 16:53:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-03-04 16:53:50,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-03-04 16:53:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:50,526 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:53:50,526 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:53:50,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:53:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:53:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-03-04 16:53:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:53:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-03-04 16:53:50,539 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-03-04 16:53:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:50,540 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-03-04 16:53:50,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-03-04 16:53:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-03-04 16:53:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-03-04 16:53:50,541 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:50,543 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-03-04 16:53:50,543 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-03-04 16:53:50,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:50,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:50,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:50,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:53:50,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:50,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 56 conjunts are in the unsatisfiable core [2019-03-04 16:53:50,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:50,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:50,931 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,943 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,944 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-03-04 16:53:51,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:51,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:53:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:53:51,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:53:51,635 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-03-04 16:53:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:52,183 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-03-04 16:53:52,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:53:52,184 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-03-04 16:53:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:52,185 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:53:52,185 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:53:52,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:53:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:53:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-03-04 16:53:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:53:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-03-04 16:53:52,196 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-03-04 16:53:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:52,197 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-03-04 16:53:52,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:53:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-03-04 16:53:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-03-04 16:53:52,198 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:52,198 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-03-04 16:53:52,198 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-03-04 16:53:52,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:52,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:52,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:52,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:52,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:52,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:52,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:52,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:52,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:52,489 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-03-04 16:53:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:52,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:52,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-03-04 16:53:52,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:52,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 61 conjunts are in the unsatisfiable core [2019-03-04 16:53:52,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:52,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:52,596 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,604 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:53,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:53,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-03-04 16:53:53,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:53,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-03-04 16:53:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-03-04 16:53:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:53:53,275 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-03-04 16:53:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:53,810 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-03-04 16:53:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:53:53,810 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-03-04 16:53:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:53,811 INFO L225 Difference]: With dead ends: 85 [2019-03-04 16:53:53,811 INFO L226 Difference]: Without dead ends: 84 [2019-03-04 16:53:53,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:53:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-03-04 16:53:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-03-04 16:53:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:53:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-03-04 16:53:53,826 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-03-04 16:53:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:53,826 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-03-04 16:53:53,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-03-04 16:53:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-03-04 16:53:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-03-04 16:53:53,827 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:53,827 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-03-04 16:53:53,828 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-03-04 16:53:53,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:53,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:53,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:54,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:54,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:54,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:54,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:54,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:54,734 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-03-04 16:53:54,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:54,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:54,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:54,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:54,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:53:54,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:54,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:54,811 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:54,819 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:54,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:56,597 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:57,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:57,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-03-04 16:53:57,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:57,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-03-04 16:53:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-03-04 16:53:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:53:57,091 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-03-04 16:53:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:57,691 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-03-04 16:53:57,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:53:57,692 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-03-04 16:53:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:57,693 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:53:57,693 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:53:57,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:53:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:53:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-03-04 16:53:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-03-04 16:53:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-03-04 16:53:57,708 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-03-04 16:53:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:57,708 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-03-04 16:53:57,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-03-04 16:53:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-03-04 16:53:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-03-04 16:53:57,710 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:57,710 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-03-04 16:53:57,710 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-03-04 16:53:57,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:57,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:57,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:58,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:58,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:58,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:58,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:58,062 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-03-04 16:53:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:58,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:58,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 65 conjunts are in the unsatisfiable core [2019-03-04 16:53:58,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:58,139 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:53:58,139 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,151 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,152 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:58,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-03-04 16:53:58,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:58,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:53:58,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:53:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:53:58,953 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-03-04 16:53:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:59,768 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-03-04 16:53:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-03-04 16:53:59,768 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-03-04 16:53:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:59,769 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:53:59,769 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:53:59,771 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-03-04 16:53:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:53:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-03-04 16:53:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:53:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-03-04 16:53:59,779 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-03-04 16:53:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:59,780 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-03-04 16:53:59,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:53:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-03-04 16:53:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-03-04 16:53:59,780 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:59,781 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-03-04 16:53:59,781 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:53:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-03-04 16:53:59,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:59,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:59,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:59,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:59,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:00,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:00,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:00,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:00,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:00,190 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-03-04 16:54:00,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:00,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:00,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-03-04 16:54:00,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:00,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:54:00,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:00,319 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:00,319 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,324 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:01,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:01,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-03-04 16:54:01,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:01,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-03-04 16:54:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-03-04 16:54:01,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:54:01,341 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-03-04 16:54:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:01,988 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-03-04 16:54:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:54:01,989 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-03-04 16:54:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:01,990 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:54:01,990 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:54:01,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:54:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:54:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-03-04 16:54:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-03-04 16:54:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-03-04 16:54:02,003 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-03-04 16:54:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:02,003 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-03-04 16:54:02,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-03-04 16:54:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-03-04 16:54:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-03-04 16:54:02,004 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:02,004 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-03-04 16:54:02,005 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-03-04 16:54:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:02,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:02,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:02,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,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 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-03-04 16:54:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:02,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:02,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:02,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:02,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 73 conjunts are in the unsatisfiable core [2019-03-04 16:54:02,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:02,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:02,450 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,471 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,471 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:03,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-03-04 16:54:03,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:03,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-03-04 16:54:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-03-04 16:54:03,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:54:03,471 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-03-04 16:54:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:04,153 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-03-04 16:54:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:54:04,153 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-03-04 16:54:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:04,154 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:54:04,154 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:54:04,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-03-04 16:54:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:54:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-03-04 16:54:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:54:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-03-04 16:54:04,166 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-03-04 16:54:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:04,166 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-03-04 16:54:04,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-03-04 16:54:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-03-04 16:54:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-03-04 16:54:04,166 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:04,167 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-03-04 16:54:04,167 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-03-04 16:54:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:04,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:04,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:05,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:05,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:05,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,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 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-03-04 16:54:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:05,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:05,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 74 conjunts are in the unsatisfiable core [2019-03-04 16:54:05,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:05,166 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:05,166 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,176 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:06,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-03-04 16:54:06,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:06,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:54:06,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:54:06,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:54:06,285 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-03-04 16:54:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:07,051 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-03-04 16:54:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-03-04 16:54:07,054 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-03-04 16:54:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:07,055 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:54:07,055 INFO L226 Difference]: Without dead ends: 109 [2019-03-04 16:54:07,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:54:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-03-04 16:54:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-03-04 16:54:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-03-04 16:54:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-03-04 16:54:07,066 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-03-04 16:54:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:07,066 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-03-04 16:54:07,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:54:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-03-04 16:54:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-03-04 16:54:07,067 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:07,067 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-03-04 16:54:07,068 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-03-04 16:54:07,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:07,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:07,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:07,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:07,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:07,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:07,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:07,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:07,892 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-03-04 16:54:07,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:07,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:08,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-03-04 16:54:08,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:08,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 79 conjunts are in the unsatisfiable core [2019-03-04 16:54:08,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:08,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:08,019 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,033 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,033 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:08,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:09,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-03-04 16:54:09,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:09,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-03-04 16:54:09,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-03-04 16:54:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:54:09,494 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-03-04 16:54:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:10,495 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-03-04 16:54:10,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-03-04 16:54:10,495 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-03-04 16:54:10,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:10,496 INFO L225 Difference]: With dead ends: 115 [2019-03-04 16:54:10,497 INFO L226 Difference]: Without dead ends: 114 [2019-03-04 16:54:10,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-03-04 16:54:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-03-04 16:54:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-03-04 16:54:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-03-04 16:54:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-03-04 16:54:10,512 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-03-04 16:54:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:10,512 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-03-04 16:54:10,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-03-04 16:54:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-03-04 16:54:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-03-04 16:54:10,513 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:10,513 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-03-04 16:54:10,513 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-03-04 16:54:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:10,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:10,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:11,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:11,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:11,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:11,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:11,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:11,036 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-03-04 16:54:11,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:11,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:11,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:11,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:11,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 82 conjunts are in the unsatisfiable core [2019-03-04 16:54:11,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:11,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:11,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,237 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,237 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:11,660 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:12,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:12,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-03-04 16:54:12,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:12,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-03-04 16:54:12,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-03-04 16:54:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:54:12,555 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-03-04 16:54:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:13,477 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-03-04 16:54:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:54:13,478 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-03-04 16:54:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:13,479 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:54:13,479 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:54:13,482 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-03-04 16:54:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:54:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-03-04 16:54:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-03-04 16:54:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-03-04 16:54:13,500 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-03-04 16:54:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:13,500 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-03-04 16:54:13,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-03-04 16:54:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-03-04 16:54:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-03-04 16:54:13,501 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:13,501 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-03-04 16:54:13,502 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-03-04 16:54:13,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:13,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:13,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:13,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:13,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:13,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:13,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:13,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:13,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:13,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:13,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:54:13,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:13,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:14,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 83 conjunts are in the unsatisfiable core [2019-03-04 16:54:14,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:14,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:14,050 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,063 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,064 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:14,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:15,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:15,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-03-04 16:54:15,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:15,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:54:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:54:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:54:15,599 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-03-04 16:54:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:16,607 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-03-04 16:54:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:54:16,607 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-03-04 16:54:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:16,609 INFO L225 Difference]: With dead ends: 125 [2019-03-04 16:54:16,609 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:54:16,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:54:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:54:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-03-04 16:54:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:54:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-03-04 16:54:16,625 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-03-04 16:54:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:16,625 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-03-04 16:54:16,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:54:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-03-04 16:54:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-03-04 16:54:16,626 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:16,626 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-03-04 16:54:16,626 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-03-04 16:54:16,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:16,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:16,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:17,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:17,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:17,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:17,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:17,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:17,402 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-03-04 16:54:17,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:17,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:17,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-03-04 16:54:17,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:17,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 88 conjunts are in the unsatisfiable core [2019-03-04 16:54:17,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:17,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:17,534 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,542 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,542 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:18,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:18,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:18,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-03-04 16:54:18,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:18,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-03-04 16:54:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-03-04 16:54:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:54:18,968 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-03-04 16:54:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:20,052 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-03-04 16:54:20,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:54:20,052 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-03-04 16:54:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:20,053 INFO L225 Difference]: With dead ends: 130 [2019-03-04 16:54:20,053 INFO L226 Difference]: Without dead ends: 129 [2019-03-04 16:54:20,054 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-03-04 16:54:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-03-04 16:54:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-03-04 16:54:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-03-04 16:54:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-03-04 16:54:20,071 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-03-04 16:54:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:20,071 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-03-04 16:54:20,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-03-04 16:54:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-03-04 16:54:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-03-04 16:54:20,072 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:20,072 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-03-04 16:54:20,072 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-03-04 16:54:20,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:20,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:20,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:21,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:21,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:21,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:21,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:21,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:21,327 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-03-04 16:54:21,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:21,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:21,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:21,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:21,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:54:21,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:21,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:21,443 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,452 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,452 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:21,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:22,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:22,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-03-04 16:54:22,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:22,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-03-04 16:54:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-03-04 16:54:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:54:22,887 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-03-04 16:54:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:23,974 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-03-04 16:54:23,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-03-04 16:54:23,975 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-03-04 16:54:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:23,976 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:54:23,976 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:54:23,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:54:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:54:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-03-04 16:54:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-03-04 16:54:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-03-04 16:54:23,999 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-03-04 16:54:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:23,999 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-03-04 16:54:23,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-03-04 16:54:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-03-04 16:54:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-03-04 16:54:24,000 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:24,001 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-03-04 16:54:24,001 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-03-04 16:54:24,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:24,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:24,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:24,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:24,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:25,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:25,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:25,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:25,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:25,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:25,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:54:25,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:25,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:25,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 92 conjunts are in the unsatisfiable core [2019-03-04 16:54:25,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:25,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:25,550 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,560 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,560 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:26,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:27,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-03-04 16:54:27,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:27,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-03-04 16:54:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-03-04 16:54:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:54:27,099 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-03-04 16:54:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:28,193 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-03-04 16:54:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:54:28,194 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-03-04 16:54:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:28,195 INFO L225 Difference]: With dead ends: 140 [2019-03-04 16:54:28,195 INFO L226 Difference]: Without dead ends: 139 [2019-03-04 16:54:28,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:54:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-03-04 16:54:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-03-04 16:54:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:54:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-03-04 16:54:28,217 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-03-04 16:54:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:28,218 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-03-04 16:54:28,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-03-04 16:54:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-03-04 16:54:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:54:28,219 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:28,219 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-03-04 16:54:28,219 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-03-04 16:54:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:28,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:28,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:28,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:28,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:28,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:28,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:28,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:28,760 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-03-04 16:54:28,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:28,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:28,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-03-04 16:54:28,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:28,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 97 conjunts are in the unsatisfiable core [2019-03-04 16:54:28,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:28,959 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:28,959 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,049 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,050 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:30,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:32,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:32,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-03-04 16:54:32,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:32,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-03-04 16:54:32,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-03-04 16:54:32,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:54:32,035 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-03-04 16:54:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:33,149 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-03-04 16:54:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:54:33,149 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-03-04 16:54:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:33,150 INFO L225 Difference]: With dead ends: 145 [2019-03-04 16:54:33,150 INFO L226 Difference]: Without dead ends: 144 [2019-03-04 16:54:33,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:54:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-03-04 16:54:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-03-04 16:54:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-03-04 16:54:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-03-04 16:54:33,169 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-03-04 16:54:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:33,170 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-03-04 16:54:33,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-03-04 16:54:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-03-04 16:54:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-03-04 16:54:33,171 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:33,171 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-03-04 16:54:33,171 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-03-04 16:54:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:33,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:33,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:33,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:33,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:33,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:33,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:33,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:33,909 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-03-04 16:54:33,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:33,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:34,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:34,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:34,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 100 conjunts are in the unsatisfiable core [2019-03-04 16:54:34,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:34,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:34,023 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,041 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,041 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:34,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:36,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-03-04 16:54:36,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:36,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-03-04 16:54:36,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-03-04 16:54:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:54:36,475 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-03-04 16:54:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:37,714 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-03-04 16:54:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:54:37,714 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-03-04 16:54:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:37,715 INFO L225 Difference]: With dead ends: 150 [2019-03-04 16:54:37,715 INFO L226 Difference]: Without dead ends: 149 [2019-03-04 16:54:37,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:54:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-03-04 16:54:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-03-04 16:54:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-03-04 16:54:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-03-04 16:54:37,737 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-03-04 16:54:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:37,738 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-03-04 16:54:37,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-03-04 16:54:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-03-04 16:54:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-03-04 16:54:37,739 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:37,739 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-03-04 16:54:37,739 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-03-04 16:54:37,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:37,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:37,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:38,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:38,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:38,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:38,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:38,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:38,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:54:38,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:38,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:38,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 101 conjunts are in the unsatisfiable core [2019-03-04 16:54:38,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:38,610 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:38,611 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,619 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,620 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:39,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:40,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:40,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-03-04 16:54:40,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:40,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-03-04 16:54:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-03-04 16:54:40,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:54:40,812 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-03-04 16:54:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:42,010 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-03-04 16:54:42,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-03-04 16:54:42,010 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-03-04 16:54:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:42,011 INFO L225 Difference]: With dead ends: 155 [2019-03-04 16:54:42,011 INFO L226 Difference]: Without dead ends: 154 [2019-03-04 16:54:42,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:54:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-03-04 16:54:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-03-04 16:54:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-03-04 16:54:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-03-04 16:54:42,033 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-03-04 16:54:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:42,034 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-03-04 16:54:42,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-03-04 16:54:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-03-04 16:54:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-03-04 16:54:42,034 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:42,035 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-03-04 16:54:42,035 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-03-04 16:54:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:42,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:43,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:43,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:43,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:43,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,416 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-03-04 16:54:43,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:43,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:43,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-03-04 16:54:43,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:43,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 106 conjunts are in the unsatisfiable core [2019-03-04 16:54:43,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:43,602 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:43,602 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:43,615 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:43,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-03-04 16:54:46,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:46,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-03-04 16:54:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-03-04 16:54:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:54:46,339 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-03-04 16:54:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:47,655 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-03-04 16:54:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:54:47,655 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-03-04 16:54:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:47,656 INFO L225 Difference]: With dead ends: 160 [2019-03-04 16:54:47,657 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:54:47,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:54:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:54:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-03-04 16:54:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-03-04 16:54:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-03-04 16:54:47,689 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-03-04 16:54:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:47,689 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-03-04 16:54:47,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-03-04 16:54:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-03-04 16:54:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-03-04 16:54:47,691 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:47,691 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-03-04 16:54:47,691 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-03-04 16:54:47,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:47,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:47,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:48,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:48,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:48,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:48,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:48,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:48,432 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-03-04 16:54:48,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:48,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:48,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:48,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:48,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 109 conjunts are in the unsatisfiable core [2019-03-04 16:54:48,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:48,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:48,550 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,559 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,559 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:49,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:51,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:51,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-03-04 16:54:51,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:51,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-03-04 16:54:51,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-03-04 16:54:51,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:54:51,163 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-03-04 16:54:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:52,573 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-03-04 16:54:52,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:54:52,574 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-03-04 16:54:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:52,575 INFO L225 Difference]: With dead ends: 165 [2019-03-04 16:54:52,575 INFO L226 Difference]: Without dead ends: 164 [2019-03-04 16:54:52,576 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-03-04 16:54:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-03-04 16:54:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-03-04 16:54:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:54:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-03-04 16:54:52,605 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-03-04 16:54:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:52,606 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-03-04 16:54:52,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-03-04 16:54:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-03-04 16:54:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-03-04 16:54:52,607 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:52,607 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-03-04 16:54:52,607 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-03-04 16:54:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:52,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:52,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:53,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:53,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:53,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:53,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:53,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:53,387 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-03-04 16:54:53,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:53,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:53,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 110 conjunts are in the unsatisfiable core [2019-03-04 16:54:53,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:53,500 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:53,501 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,511 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,511 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:54,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:56,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:56,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-03-04 16:54:56,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:56,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-03-04 16:54:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-03-04 16:54:56,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:54:56,060 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-03-04 16:54:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:57,926 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-03-04 16:54:57,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:54:57,932 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-03-04 16:54:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:57,933 INFO L225 Difference]: With dead ends: 170 [2019-03-04 16:54:57,933 INFO L226 Difference]: Without dead ends: 169 [2019-03-04 16:54:57,935 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-03-04 16:54:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-03-04 16:54:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-03-04 16:54:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-03-04 16:54:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-03-04 16:54:57,963 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-03-04 16:54:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:57,963 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-03-04 16:54:57,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-03-04 16:54:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-03-04 16:54:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-03-04 16:54:57,964 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:57,965 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-03-04 16:54:57,965 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:54:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-03-04 16:54:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:57,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:57,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:58,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:58,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:58,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:58,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:58,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:58,795 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-03-04 16:54:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:58,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:58,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-03-04 16:54:58,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:58,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:54:58,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:59,008 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:54:59,009 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:59,016 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:59,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:59,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:01,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:01,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-03-04 16:55:01,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:01,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-03-04 16:55:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-03-04 16:55:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:55:01,752 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-03-04 16:55:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:03,239 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-03-04 16:55:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:55:03,239 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-03-04 16:55:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:03,240 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:55:03,241 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:55:03,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-03-04 16:55:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:55:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-03-04 16:55:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-03-04 16:55:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-03-04 16:55:03,278 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-03-04 16:55:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:03,278 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-03-04 16:55:03,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-03-04 16:55:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-03-04 16:55:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-03-04 16:55:03,280 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:03,280 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-03-04 16:55:03,280 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-03-04 16:55:03,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:03,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:03,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:04,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:04,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:04,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:04,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:04,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:04,434 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-03-04 16:55:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:04,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:04,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:04,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:04,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 118 conjunts are in the unsatisfiable core [2019-03-04 16:55:04,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:04,574 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:04,575 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:04,583 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:04,583 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:05,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:07,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:07,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-03-04 16:55:07,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:07,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-03-04 16:55:07,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-03-04 16:55:07,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:55:07,410 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-03-04 16:55:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:08,933 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-03-04 16:55:08,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-03-04 16:55:08,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-03-04 16:55:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:08,935 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:55:08,935 INFO L226 Difference]: Without dead ends: 179 [2019-03-04 16:55:08,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 16:55:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-03-04 16:55:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-03-04 16:55:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-03-04 16:55:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-03-04 16:55:08,960 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-03-04 16:55:08,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:08,960 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-03-04 16:55:08,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-03-04 16:55:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-03-04 16:55:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-03-04 16:55:08,961 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:08,961 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-03-04 16:55:08,962 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-03-04 16:55:08,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:08,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:08,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:10,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:10,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:10,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:10,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:10,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:10,409 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-03-04 16:55:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:10,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:10,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 119 conjunts are in the unsatisfiable core [2019-03-04 16:55:10,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:10,558 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:10,559 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,632 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,633 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:11,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:13,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:13,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-03-04 16:55:13,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:13,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:55:13,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:55:13,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:55:13,563 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-03-04 16:55:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:15,273 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-03-04 16:55:15,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:55:15,273 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-03-04 16:55:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:15,274 INFO L225 Difference]: With dead ends: 185 [2019-03-04 16:55:15,275 INFO L226 Difference]: Without dead ends: 184 [2019-03-04 16:55:15,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:55:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-03-04 16:55:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-03-04 16:55:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-03-04 16:55:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-03-04 16:55:15,309 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-03-04 16:55:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:15,309 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-03-04 16:55:15,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:55:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-03-04 16:55:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-03-04 16:55:15,310 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:15,311 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-03-04 16:55:15,311 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:15,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-03-04 16:55:15,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:15,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:15,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:16,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:16,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:16,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:16,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:16,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:16,228 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-03-04 16:55:16,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:16,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:16,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-03-04 16:55:16,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:16,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 124 conjunts are in the unsatisfiable core [2019-03-04 16:55:16,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:16,487 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:16,488 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,544 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,545 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:17,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:19,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:19,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-03-04 16:55:19,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:19,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-03-04 16:55:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-03-04 16:55:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:55:19,426 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-03-04 16:55:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:21,050 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-03-04 16:55:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:55:21,050 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-03-04 16:55:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:21,051 INFO L225 Difference]: With dead ends: 190 [2019-03-04 16:55:21,051 INFO L226 Difference]: Without dead ends: 189 [2019-03-04 16:55:21,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:55:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-03-04 16:55:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-03-04 16:55:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-03-04 16:55:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-03-04 16:55:21,087 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-03-04 16:55:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:21,087 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-03-04 16:55:21,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-03-04 16:55:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-03-04 16:55:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-03-04 16:55:21,089 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:21,089 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-03-04 16:55:21,089 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-03-04 16:55:21,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:21,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:21,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:21,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:21,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:22,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:22,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:22,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:22,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:22,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:22,366 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-03-04 16:55:22,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:22,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:22,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:22,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:22,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 127 conjunts are in the unsatisfiable core [2019-03-04 16:55:22,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:22,529 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:22,530 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,599 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:24,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:26,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:26,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-03-04 16:55:26,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:26,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-03-04 16:55:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-03-04 16:55:26,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:55:26,201 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-03-04 16:55:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:28,250 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-03-04 16:55:28,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-03-04 16:55:28,251 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-03-04 16:55:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:28,252 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:55:28,252 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:55:28,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:55:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:55:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-03-04 16:55:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-03-04 16:55:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-03-04 16:55:28,285 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-03-04 16:55:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:28,285 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-03-04 16:55:28,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-03-04 16:55:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-03-04 16:55:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-03-04 16:55:28,287 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:28,287 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-03-04 16:55:28,287 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-03-04 16:55:28,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:28,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:28,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:29,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:29,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:29,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:29,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:29,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:29,264 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-03-04 16:55:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:29,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:29,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 128 conjunts are in the unsatisfiable core [2019-03-04 16:55:29,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:29,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:29,404 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:29,412 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:29,413 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:30,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:32,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-03-04 16:55:32,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:32,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:55:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:55:32,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:55:32,713 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-03-04 16:55:33,286 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-03-04 16:55:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:35,053 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-03-04 16:55:35,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-03-04 16:55:35,053 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-03-04 16:55:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:35,054 INFO L225 Difference]: With dead ends: 200 [2019-03-04 16:55:35,054 INFO L226 Difference]: Without dead ends: 199 [2019-03-04 16:55:35,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:55:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-03-04 16:55:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-03-04 16:55:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-03-04 16:55:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-03-04 16:55:35,085 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-03-04 16:55:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:35,085 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-03-04 16:55:35,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:55:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-03-04 16:55:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-03-04 16:55:35,086 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:35,086 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-03-04 16:55:35,086 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-03-04 16:55:35,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:35,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:35,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:35,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:35,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:36,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:36,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:36,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:36,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:36,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:36,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:55:36,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:36,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:36,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-03-04 16:55:36,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:36,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 133 conjunts are in the unsatisfiable core [2019-03-04 16:55:36,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:36,860 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:36,860 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:36,872 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:36,872 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:38,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:40,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:40,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-03-04 16:55:40,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:40,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-03-04 16:55:40,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-03-04 16:55:40,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:55:40,145 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-03-04 16:55:42,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:42,247 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-03-04 16:55:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-03-04 16:55:42,247 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-03-04 16:55:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:42,248 INFO L225 Difference]: With dead ends: 205 [2019-03-04 16:55:42,248 INFO L226 Difference]: Without dead ends: 204 [2019-03-04 16:55:42,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:55:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-03-04 16:55:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-03-04 16:55:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-03-04 16:55:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-03-04 16:55:42,281 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-03-04 16:55:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:42,281 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-03-04 16:55:42,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-03-04 16:55:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-03-04 16:55:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-03-04 16:55:42,282 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:42,282 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-03-04 16:55:42,282 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-03-04 16:55:42,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:42,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:42,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:43,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:43,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:43,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:43,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:43,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:43,301 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-03-04 16:55:43,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:43,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:43,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:43,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:43,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 136 conjunts are in the unsatisfiable core [2019-03-04 16:55:43,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:43,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:43,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:43,463 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:43,463 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:44,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:46,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:46,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-03-04 16:55:46,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-03-04 16:55:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-03-04 16:55:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:55:46,787 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-03-04 16:55:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:48,784 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-03-04 16:55:48,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:55:48,785 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-03-04 16:55:48,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:48,786 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:55:48,786 INFO L226 Difference]: Without dead ends: 209 [2019-03-04 16:55:48,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:55:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-03-04 16:55:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-03-04 16:55:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-03-04 16:55:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-03-04 16:55:48,819 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-03-04 16:55:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:48,820 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-03-04 16:55:48,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-03-04 16:55:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-03-04 16:55:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-03-04 16:55:48,821 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:48,821 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-03-04 16:55:48,821 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-03-04 16:55:48,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:48,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:48,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:48,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:49,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:49,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:49,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:49,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,826 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-03-04 16:55:49,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:49,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:49,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 137 conjunts are in the unsatisfiable core [2019-03-04 16:55:49,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:49,970 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:49,971 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,979 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,979 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:51,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:53,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:53,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-03-04 16:55:53,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:53,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:55:53,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:55:53,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:55:53,756 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-03-04 16:55:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:55,797 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-03-04 16:55:55,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-03-04 16:55:55,797 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-03-04 16:55:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:55,799 INFO L225 Difference]: With dead ends: 215 [2019-03-04 16:55:55,799 INFO L226 Difference]: Without dead ends: 214 [2019-03-04 16:55:55,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:55:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-03-04 16:55:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-03-04 16:55:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-03-04 16:55:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-03-04 16:55:55,839 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-03-04 16:55:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:55,840 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-03-04 16:55:55,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:55:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-03-04 16:55:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-03-04 16:55:55,841 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:55,841 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-03-04 16:55:55,841 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:55:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-03-04 16:55:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:55,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:56,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:56,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:56,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:56,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:56,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:56,997 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-03-04 16:55:57,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:57,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:57,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-03-04 16:55:57,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:57,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 142 conjunts are in the unsatisfiable core [2019-03-04 16:55:57,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:57,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:55:57,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:57,436 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:57,436 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:58,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:01,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:01,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-03-04 16:56:01,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:01,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-03-04 16:56:01,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-03-04 16:56:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:56:01,091 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-03-04 16:56:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:03,334 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-03-04 16:56:03,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-03-04 16:56:03,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-03-04 16:56:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:03,335 INFO L225 Difference]: With dead ends: 220 [2019-03-04 16:56:03,335 INFO L226 Difference]: Without dead ends: 219 [2019-03-04 16:56:03,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:56:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-03-04 16:56:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-03-04 16:56:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-03-04 16:56:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-03-04 16:56:03,370 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-03-04 16:56:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:03,370 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-03-04 16:56:03,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-03-04 16:56:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-03-04 16:56:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-03-04 16:56:03,371 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:03,371 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-03-04 16:56:03,371 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:56:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:03,372 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-03-04 16:56:03,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:03,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:03,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:03,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:04,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:04,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:04,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:04,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:04,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:04,787 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-03-04 16:56:04,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:04,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:04,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:04,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:04,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 145 conjunts are in the unsatisfiable core [2019-03-04 16:56:04,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:04,950 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:56:04,950 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:04,958 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:04,959 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:06,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:09,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:09,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-03-04 16:56:09,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:09,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-03-04 16:56:09,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-03-04 16:56:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:56:09,119 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-03-04 16:56:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:11,362 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-03-04 16:56:11,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:56:11,363 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-03-04 16:56:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:11,364 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:56:11,364 INFO L226 Difference]: Without dead ends: 224 [2019-03-04 16:56:11,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:56:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-03-04 16:56:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-03-04 16:56:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:56:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-03-04 16:56:11,400 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-03-04 16:56:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:11,400 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-03-04 16:56:11,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-03-04 16:56:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-03-04 16:56:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-03-04 16:56:11,401 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:11,401 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-03-04 16:56:11,401 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:56:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-03-04 16:56:11,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:11,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:11,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:11,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:11,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:12,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:12,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:12,792 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:12,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:12,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:12,792 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-03-04 16:56:12,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:12,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:12,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 146 conjunts are in the unsatisfiable core [2019-03-04 16:56:12,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:12,945 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:56:12,945 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:12,958 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:12,958 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:14,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:16,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:16,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-03-04 16:56:16,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:16,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:56:16,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:56:16,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:56:16,938 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-03-04 16:56:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:19,388 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-03-04 16:56:19,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:56:19,388 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-03-04 16:56:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:19,389 INFO L225 Difference]: With dead ends: 230 [2019-03-04 16:56:19,389 INFO L226 Difference]: Without dead ends: 229 [2019-03-04 16:56:19,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:56:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-03-04 16:56:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-03-04 16:56:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-03-04 16:56:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-03-04 16:56:19,437 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-03-04 16:56:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:19,437 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-03-04 16:56:19,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:56:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-03-04 16:56:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-03-04 16:56:19,438 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:19,438 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-03-04 16:56:19,439 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:56:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-03-04 16:56:19,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:19,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:19,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:19,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:20,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:20,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:20,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:20,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:20,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:20,613 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-03-04 16:56:20,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:20,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:20,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-03-04 16:56:20,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:20,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 151 conjunts are in the unsatisfiable core [2019-03-04 16:56:20,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:20,917 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:56:20,917 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:20,927 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:20,928 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:22,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:25,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:25,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-03-04 16:56:25,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:25,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-03-04 16:56:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-03-04 16:56:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:56:25,582 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-03-04 16:56:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:28,284 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-03-04 16:56:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-03-04 16:56:28,285 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-03-04 16:56:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:28,286 INFO L225 Difference]: With dead ends: 235 [2019-03-04 16:56:28,286 INFO L226 Difference]: Without dead ends: 234 [2019-03-04 16:56:28,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:56:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-03-04 16:56:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-03-04 16:56:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-03-04 16:56:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-03-04 16:56:28,346 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-03-04 16:56:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:28,346 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-03-04 16:56:28,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-03-04 16:56:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-03-04 16:56:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-03-04 16:56:28,348 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:28,348 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-03-04 16:56:28,348 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:56:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-03-04 16:56:28,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:28,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:28,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:28,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:28,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:29,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:29,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:29,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:29,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:29,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:29,498 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-03-04 16:56:29,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:29,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:29,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:29,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:29,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 154 conjunts are in the unsatisfiable core [2019-03-04 16:56:29,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:29,673 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:56:29,673 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,681 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,681 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:31,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:34,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:34,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-03-04 16:56:34,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:34,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-03-04 16:56:34,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-03-04 16:56:34,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:56:34,156 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-03-04 16:56:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:36,730 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-03-04 16:56:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:56:36,730 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-03-04 16:56:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:36,731 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:56:36,732 INFO L226 Difference]: Without dead ends: 239 [2019-03-04 16:56:36,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:56:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-03-04 16:56:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-03-04 16:56:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-03-04 16:56:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-03-04 16:56:36,797 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-03-04 16:56:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:36,797 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-03-04 16:56:36,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-03-04 16:56:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-03-04 16:56:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-03-04 16:56:36,832 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:36,832 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-03-04 16:56:36,832 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:56:36,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-03-04 16:56:36,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:36,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:36,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:38,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:38,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:38,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:38,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:38,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:38,047 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-03-04 16:56:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:38,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:38,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 155 conjunts are in the unsatisfiable core [2019-03-04 16:56:38,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:38,231 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:56:38,231 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:38,239 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:38,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:39,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:42,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:42,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-03-04 16:56:42,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:42,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-03-04 16:56:42,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-03-04 16:56:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:56:42,994 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-03-04 16:56:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:45,793 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-03-04 16:56:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:56:45,793 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-03-04 16:56:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:45,794 INFO L225 Difference]: With dead ends: 245 [2019-03-04 16:56:45,794 INFO L226 Difference]: Without dead ends: 244 [2019-03-04 16:56:45,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:56:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-03-04 16:56:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-03-04 16:56:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:56:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-03-04 16:56:45,839 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-03-04 16:56:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:45,840 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-03-04 16:56:45,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-03-04 16:56:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-03-04 16:56:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:56:45,841 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:45,841 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-03-04 16:56:45,841 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:56:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-03-04 16:56:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:45,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:47,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:47,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:47,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:47,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:47,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:47,120 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-03-04 16:56:47,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:47,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:47,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-03-04 16:56:47,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:47,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 160 conjunts are in the unsatisfiable core [2019-03-04 16:56:47,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:47,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:56:47,451 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,464 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:49,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:52,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:52,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-03-04 16:56:52,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:52,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-03-04 16:56:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-03-04 16:56:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-03-04 16:56:52,492 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-03-04 16:56:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:55,183 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-03-04 16:56:55,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:56:55,183 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-03-04 16:56:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:55,184 INFO L225 Difference]: With dead ends: 250 [2019-03-04 16:56:55,184 INFO L226 Difference]: Without dead ends: 249 [2019-03-04 16:56:55,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:56:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-03-04 16:56:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-03-04 16:56:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-03-04 16:56:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-03-04 16:56:55,229 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-03-04 16:56:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:55,229 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-03-04 16:56:55,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-03-04 16:56:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-03-04 16:56:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-03-04 16:56:55,230 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:55,230 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-03-04 16:56:55,231 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:56:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-03-04 16:56:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:55,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:55,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:55,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:56,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:56,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:56,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:56,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:56,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:56,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:56:56,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:56,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:56,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:56,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:56,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:56:56,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:56,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:56:56,744 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,752 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:58,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:01,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:01,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-03-04 16:57:01,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:01,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-03-04 16:57:01,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-03-04 16:57:01,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:57:01,959 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-03-04 16:57:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:04,888 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-03-04 16:57:04,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-03-04 16:57:04,889 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-03-04 16:57:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:04,890 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:57:04,891 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 16:57:04,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:57:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 16:57:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-03-04 16:57:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-03-04 16:57:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-03-04 16:57:04,962 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-03-04 16:57:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:04,962 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-03-04 16:57:04,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-03-04 16:57:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-03-04 16:57:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-03-04 16:57:04,964 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:04,964 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-03-04 16:57:04,964 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:57:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:04,965 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-03-04 16:57:04,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:04,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:04,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:04,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:04,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:06,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:06,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:06,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:06,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:06,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:06,358 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-03-04 16:57:06,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:06,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:06,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 164 conjunts are in the unsatisfiable core [2019-03-04 16:57:06,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:06,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:57:06,533 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:06,541 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:06,541 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:08,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:12,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:12,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-03-04 16:57:12,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:12,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:57:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:57:12,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:57:12,185 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-03-04 16:57:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:15,143 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-03-04 16:57:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:57:15,144 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-03-04 16:57:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:15,145 INFO L225 Difference]: With dead ends: 260 [2019-03-04 16:57:15,145 INFO L226 Difference]: Without dead ends: 259 [2019-03-04 16:57:15,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-03-04 16:57:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-03-04 16:57:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-03-04 16:57:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-03-04 16:57:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-03-04 16:57:15,209 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-03-04 16:57:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:15,209 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-03-04 16:57:15,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:57:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-03-04 16:57:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-03-04 16:57:15,211 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:15,211 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-03-04 16:57:15,212 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:57:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-03-04 16:57:15,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:15,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:15,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:16,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:16,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:16,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:16,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:16,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:16,638 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-03-04 16:57:16,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:16,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:16,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-03-04 16:57:16,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:16,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 169 conjunts are in the unsatisfiable core [2019-03-04 16:57:16,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:16,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:57:16,989 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:16,998 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:16,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:18,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:22,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:22,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-03-04 16:57:22,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:22,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-03-04 16:57:22,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-03-04 16:57:22,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:57:22,418 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-03-04 16:57:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:25,619 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-03-04 16:57:25,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:57:25,620 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-03-04 16:57:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:25,621 INFO L225 Difference]: With dead ends: 265 [2019-03-04 16:57:25,621 INFO L226 Difference]: Without dead ends: 264 [2019-03-04 16:57:25,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-03-04 16:57:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-03-04 16:57:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-03-04 16:57:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-03-04 16:57:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-03-04 16:57:25,669 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-03-04 16:57:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:25,669 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-03-04 16:57:25,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-03-04 16:57:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-03-04 16:57:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-03-04 16:57:25,671 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:25,671 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-03-04 16:57:25,671 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:57:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-03-04 16:57:25,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:25,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:25,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:25,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:27,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:27,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:27,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:27,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:27,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:27,105 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-03-04 16:57:27,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:27,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:27,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:27,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:27,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 172 conjunts are in the unsatisfiable core [2019-03-04 16:57:27,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:27,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:57:27,300 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,310 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,310 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:29,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:32,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:32,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-03-04 16:57:32,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:32,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-03-04 16:57:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-03-04 16:57:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-03-04 16:57:32,776 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-03-04 16:57:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:35,887 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-03-04 16:57:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:57:35,887 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-03-04 16:57:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:35,888 INFO L225 Difference]: With dead ends: 270 [2019-03-04 16:57:35,888 INFO L226 Difference]: Without dead ends: 269 [2019-03-04 16:57:35,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-03-04 16:57:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-03-04 16:57:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-03-04 16:57:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-03-04 16:57:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-03-04 16:57:35,948 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-03-04 16:57:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:35,948 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-03-04 16:57:35,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-03-04 16:57:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-03-04 16:57:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-03-04 16:57:35,949 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:35,949 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-03-04 16:57:35,949 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:57:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-03-04 16:57:35,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:35,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:35,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:35,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:35,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:37,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:37,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:37,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:37,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:37,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:37,390 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-03-04 16:57:37,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:37,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:37,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 173 conjunts are in the unsatisfiable core [2019-03-04 16:57:37,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:37,579 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:57:37,579 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,587 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,587 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:39,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:43,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:43,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-03-04 16:57:43,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:43,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-03-04 16:57:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-03-04 16:57:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:57:43,089 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-03-04 16:57:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:46,206 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-03-04 16:57:46,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-03-04 16:57:46,207 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-03-04 16:57:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:46,208 INFO L225 Difference]: With dead ends: 275 [2019-03-04 16:57:46,208 INFO L226 Difference]: Without dead ends: 274 [2019-03-04 16:57:46,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-03-04 16:57:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-03-04 16:57:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-03-04 16:57:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-03-04 16:57:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-03-04 16:57:46,269 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-03-04 16:57:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:46,270 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-03-04 16:57:46,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-03-04 16:57:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-03-04 16:57:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-03-04 16:57:46,271 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:46,271 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-03-04 16:57:46,271 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:57:46,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:46,272 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-03-04 16:57:46,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:46,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:46,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:46,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:47,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:47,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:47,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:47,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:47,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:47,918 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-03-04 16:57:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:47,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:48,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-03-04 16:57:48,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:48,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 178 conjunts are in the unsatisfiable core [2019-03-04 16:57:48,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:48,311 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:57:48,311 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:48,319 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:48,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:50,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:53,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:53,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-03-04 16:57:53,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:53,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-03-04 16:57:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-03-04 16:57:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-03-04 16:57:53,825 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-03-04 16:57:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:56,962 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-03-04 16:57:56,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:57:56,963 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-03-04 16:57:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:56,964 INFO L225 Difference]: With dead ends: 280 [2019-03-04 16:57:56,964 INFO L226 Difference]: Without dead ends: 279 [2019-03-04 16:57:56,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-03-04 16:57:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-03-04 16:57:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-03-04 16:57:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-03-04 16:57:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-03-04 16:57:57,025 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-03-04 16:57:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:57,026 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-03-04 16:57:57,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-03-04 16:57:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-03-04 16:57:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-03-04 16:57:57,027 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:57,028 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-03-04 16:57:57,028 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:57:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-03-04 16:57:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:57,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:57,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:58,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:58,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:58,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:58,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:58,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:58,599 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-03-04 16:57:58,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:58,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:58,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:58,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:58,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 181 conjunts are in the unsatisfiable core [2019-03-04 16:57:58,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:58,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:57:58,796 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:58,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:58,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:00,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:04,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:04,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-03-04 16:58:04,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:04,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-03-04 16:58:04,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-03-04 16:58:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:58:04,396 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-03-04 16:58:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:07,624 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-03-04 16:58:07,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:58:07,624 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-03-04 16:58:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:07,625 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:58:07,625 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 16:58:07,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-03-04 16:58:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 16:58:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-03-04 16:58:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-03-04 16:58:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-03-04 16:58:07,708 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-03-04 16:58:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:07,709 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-03-04 16:58:07,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-03-04 16:58:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-03-04 16:58:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-03-04 16:58:07,710 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:07,710 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-03-04 16:58:07,710 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:58:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:07,710 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-03-04 16:58:07,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:07,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:07,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:07,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:07,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:09,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:09,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:09,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:09,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:09,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:09,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:58:09,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:09,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:09,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 182 conjunts are in the unsatisfiable core [2019-03-04 16:58:09,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:09,487 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:58:09,487 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:09,495 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:09,496 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:11,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:15,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:15,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-03-04 16:58:15,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:15,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-03-04 16:58:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-03-04 16:58:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:58:15,295 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-03-04 16:58:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:18,670 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-03-04 16:58:18,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:58:18,671 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-03-04 16:58:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:18,672 INFO L225 Difference]: With dead ends: 290 [2019-03-04 16:58:18,672 INFO L226 Difference]: Without dead ends: 289 [2019-03-04 16:58:18,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-03-04 16:58:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-03-04 16:58:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-03-04 16:58:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-03-04 16:58:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-03-04 16:58:18,730 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-03-04 16:58:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:18,731 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-03-04 16:58:18,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-03-04 16:58:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-03-04 16:58:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-03-04 16:58:18,732 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:18,732 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-03-04 16:58:18,732 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:58:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-03-04 16:58:18,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:18,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:18,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:20,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:20,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:20,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:20,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:20,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:20,392 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-03-04 16:58:20,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:20,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:20,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-03-04 16:58:20,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:20,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 187 conjunts are in the unsatisfiable core [2019-03-04 16:58:20,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:20,865 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:58:20,866 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:20,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:20,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:22,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:26,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:26,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-03-04 16:58:26,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:26,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-03-04 16:58:26,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-03-04 16:58:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:58:26,712 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-03-04 16:58:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:30,054 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-03-04 16:58:30,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-03-04 16:58:30,054 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-03-04 16:58:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:30,056 INFO L225 Difference]: With dead ends: 295 [2019-03-04 16:58:30,056 INFO L226 Difference]: Without dead ends: 294 [2019-03-04 16:58:30,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-03-04 16:58:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-03-04 16:58:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-03-04 16:58:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-03-04 16:58:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-03-04 16:58:30,115 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-03-04 16:58:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:30,116 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-03-04 16:58:30,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-03-04 16:58:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-03-04 16:58:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-03-04 16:58:30,117 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:30,117 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-03-04 16:58:30,117 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:58:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:30,117 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-03-04 16:58:30,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:30,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:30,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:31,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:31,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:31,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:31,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:31,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:31,888 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-03-04 16:58:31,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:58:31,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:58:32,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:58:32,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:32,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 190 conjunts are in the unsatisfiable core [2019-03-04 16:58:32,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:32,099 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:58:32,099 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:32,107 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:32,107 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:34,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:37,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:37,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-03-04 16:58:37,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:37,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-03-04 16:58:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-03-04 16:58:37,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:58:37,999 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-03-04 16:58:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:41,553 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-03-04 16:58:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:58:41,553 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-03-04 16:58:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:41,554 INFO L225 Difference]: With dead ends: 300 [2019-03-04 16:58:41,554 INFO L226 Difference]: Without dead ends: 299 [2019-03-04 16:58:41,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-03-04 16:58:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-03-04 16:58:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-03-04 16:58:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-03-04 16:58:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-03-04 16:58:41,634 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-03-04 16:58:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:41,634 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-03-04 16:58:41,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-03-04 16:58:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-03-04 16:58:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-03-04 16:58:41,636 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:41,636 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-03-04 16:58:41,636 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:58:41,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:41,637 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-03-04 16:58:41,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:41,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:41,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:41,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:41,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:43,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:43,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:43,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:43,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:43,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:43,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 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-03-04 16:58:43,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:43,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:43,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 191 conjunts are in the unsatisfiable core [2019-03-04 16:58:43,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:43,653 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:58:43,654 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:43,664 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:43,665 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:45,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-03-04 16:58:49,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:49,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-03-04 16:58:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-03-04 16:58:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:58:49,778 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-03-04 16:58:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:53,506 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-03-04 16:58:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:58:53,507 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-03-04 16:58:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:53,508 INFO L225 Difference]: With dead ends: 305 [2019-03-04 16:58:53,508 INFO L226 Difference]: Without dead ends: 304 [2019-03-04 16:58:53,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-03-04 16:58:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-03-04 16:58:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-03-04 16:58:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-03-04 16:58:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-03-04 16:58:53,572 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-03-04 16:58:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:53,572 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-03-04 16:58:53,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-03-04 16:58:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-03-04 16:58:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-03-04 16:58:53,573 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:53,573 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-03-04 16:58:53,574 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:58:53,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:53,574 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-03-04 16:58:53,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:53,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:53,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:53,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:53,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:55,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:55,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:55,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:55,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:55,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:55,399 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-03-04 16:58:55,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:55,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:55,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-03-04 16:58:55,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:55,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 196 conjunts are in the unsatisfiable core [2019-03-04 16:58:55,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:55,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:58:55,854 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:55,862 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:55,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:58,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:01,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:01,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-03-04 16:59:01,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:01,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-03-04 16:59:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-03-04 16:59:01,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:59:01,909 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-03-04 16:59:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:05,574 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-03-04 16:59:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:59:05,574 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-03-04 16:59:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:05,576 INFO L225 Difference]: With dead ends: 310 [2019-03-04 16:59:05,576 INFO L226 Difference]: Without dead ends: 309 [2019-03-04 16:59:05,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-03-04 16:59:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-03-04 16:59:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-03-04 16:59:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-03-04 16:59:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-03-04 16:59:05,643 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-03-04 16:59:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:05,643 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-03-04 16:59:05,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-03-04 16:59:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-03-04 16:59:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-03-04 16:59:05,644 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:05,644 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-03-04 16:59:05,644 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:59:05,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:05,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-03-04 16:59:05,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:05,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:05,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:05,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:05,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:07,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:07,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:07,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:07,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:07,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:07,618 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-03-04 16:59:07,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:59:07,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:59:07,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:59:07,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:07,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 199 conjunts are in the unsatisfiable core [2019-03-04 16:59:07,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:07,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:59:07,836 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:07,844 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:07,844 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:10,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:14,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:14,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-03-04 16:59:14,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:14,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-03-04 16:59:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-03-04 16:59:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:59:14,052 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-03-04 16:59:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:17,931 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-03-04 16:59:17,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:59:17,932 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-03-04 16:59:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:17,933 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:59:17,933 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:59:17,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-03-04 16:59:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:59:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-03-04 16:59:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-03-04 16:59:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-03-04 16:59:18,012 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-03-04 16:59:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:18,013 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-03-04 16:59:18,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-03-04 16:59:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-03-04 16:59:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-03-04 16:59:18,014 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:18,014 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-03-04 16:59:18,014 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:59:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-03-04 16:59:18,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:18,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:18,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:18,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:19,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:19,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:19,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:19,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:19,916 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-03-04 16:59:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:19,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:20,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 200 conjunts are in the unsatisfiable core [2019-03-04 16:59:20,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:20,123 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:59:20,123 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:20,134 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:20,134 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:22,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:26,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:26,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-03-04 16:59:26,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:26,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:59:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:59:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:59:26,393 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-03-04 16:59:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:30,405 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-03-04 16:59:30,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-03-04 16:59:30,405 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-03-04 16:59:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:30,406 INFO L225 Difference]: With dead ends: 320 [2019-03-04 16:59:30,406 INFO L226 Difference]: Without dead ends: 319 [2019-03-04 16:59:30,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-03-04 16:59:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-03-04 16:59:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-03-04 16:59:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-03-04 16:59:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-03-04 16:59:30,479 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-03-04 16:59:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:30,479 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-03-04 16:59:30,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:59:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-03-04 16:59:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-03-04 16:59:30,481 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:30,481 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-03-04 16:59:30,481 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:59:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:30,482 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-03-04 16:59:30,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:30,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:32,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:32,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:32,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:32,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:32,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:32,537 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-03-04 16:59:32,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:59:32,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:59:33,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-03-04 16:59:33,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:33,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 205 conjunts are in the unsatisfiable core [2019-03-04 16:59:33,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:33,047 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:59:33,047 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:33,065 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:33,065 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:35,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:39,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:39,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-03-04 16:59:39,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:39,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-03-04 16:59:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-03-04 16:59:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:59:39,466 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-03-04 16:59:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:43,431 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-03-04 16:59:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:59:43,432 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-03-04 16:59:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:43,433 INFO L225 Difference]: With dead ends: 325 [2019-03-04 16:59:43,433 INFO L226 Difference]: Without dead ends: 324 [2019-03-04 16:59:43,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-03-04 16:59:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-03-04 16:59:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-03-04 16:59:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-03-04 16:59:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-03-04 16:59:43,507 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-03-04 16:59:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:43,507 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-03-04 16:59:43,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-03-04 16:59:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-03-04 16:59:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-03-04 16:59:43,508 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:43,509 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-03-04 16:59:43,509 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:59:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-03-04 16:59:43,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:43,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:43,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:45,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:45,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:45,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:45,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:45,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:45,509 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-03-04 16:59:45,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:59:45,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:59:45,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:59:45,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:45,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 208 conjunts are in the unsatisfiable core [2019-03-04 16:59:45,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:45,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:59:45,737 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:45,746 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:45,746 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:48,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:52,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:52,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-03-04 16:59:52,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:52,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-03-04 16:59:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-03-04 16:59:52,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-03-04 16:59:52,266 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-03-04 16:59:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:56,489 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-03-04 16:59:56,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:59:56,489 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-03-04 16:59:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:56,491 INFO L225 Difference]: With dead ends: 330 [2019-03-04 16:59:56,491 INFO L226 Difference]: Without dead ends: 329 [2019-03-04 16:59:56,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-03-04 16:59:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-03-04 16:59:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-03-04 16:59:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-03-04 16:59:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-03-04 16:59:56,565 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-03-04 16:59:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:56,565 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-03-04 16:59:56,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-03-04 16:59:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-03-04 16:59:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-03-04 16:59:56,567 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:56,567 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-03-04 16:59:56,567 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:59:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-03-04 16:59:56,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:56,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:56,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:58,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:58,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:58,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:58,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:58,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:58,775 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-03-04 16:59:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:58,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:58,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 209 conjunts are in the unsatisfiable core [2019-03-04 16:59:58,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:59,007 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:59:59,007 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:59,016 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:59,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:01,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:05,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:05,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-03-04 17:00:05,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:05,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-03-04 17:00:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-03-04 17:00:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 17:00:05,708 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-03-04 17:00:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:10,042 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-03-04 17:00:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-03-04 17:00:10,042 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-03-04 17:00:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:10,044 INFO L225 Difference]: With dead ends: 335 [2019-03-04 17:00:10,044 INFO L226 Difference]: Without dead ends: 334 [2019-03-04 17:00:10,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-03-04 17:00:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-03-04 17:00:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-03-04 17:00:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-03-04 17:00:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-03-04 17:00:10,122 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-03-04 17:00:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:10,123 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-03-04 17:00:10,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-03-04 17:00:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-03-04 17:00:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-03-04 17:00:10,124 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:10,124 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-03-04 17:00:10,124 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:00:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-03-04 17:00:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:10,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:10,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:12,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:12,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:12,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:12,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:12,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:12,242 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-03-04 17:00:12,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:00:12,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:12,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-03-04 17:00:12,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:12,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 214 conjunts are in the unsatisfiable core [2019-03-04 17:00:12,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:12,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:00:12,784 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:12,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:12,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:15,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:19,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:19,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-03-04 17:00:19,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:19,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-03-04 17:00:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-03-04 17:00:19,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-03-04 17:00:19,428 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-03-04 17:00:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:23,815 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-03-04 17:00:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 17:00:23,815 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-03-04 17:00:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:23,816 INFO L225 Difference]: With dead ends: 340 [2019-03-04 17:00:23,817 INFO L226 Difference]: Without dead ends: 339 [2019-03-04 17:00:23,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-03-04 17:00:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-03-04 17:00:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-03-04 17:00:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-03-04 17:00:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-03-04 17:00:23,905 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-03-04 17:00:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:23,906 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-03-04 17:00:23,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-03-04 17:00:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-03-04 17:00:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-03-04 17:00:23,907 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:23,907 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-03-04 17:00:23,907 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:00:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-03-04 17:00:23,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:23,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:23,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:23,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:23,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:26,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:26,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:26,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:26,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:26,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:26,096 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-03-04 17:00:26,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:00:26,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:00:26,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:00:26,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:26,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 217 conjunts are in the unsatisfiable core [2019-03-04 17:00:26,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:26,341 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:00:26,341 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:26,350 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:26,350 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:29,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:33,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:33,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-03-04 17:00:33,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:33,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-03-04 17:00:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-03-04 17:00:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 17:00:33,204 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-03-04 17:00:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:37,696 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-03-04 17:00:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-03-04 17:00:37,696 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-03-04 17:00:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:37,697 INFO L225 Difference]: With dead ends: 345 [2019-03-04 17:00:37,697 INFO L226 Difference]: Without dead ends: 344 [2019-03-04 17:00:37,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-03-04 17:00:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-03-04 17:00:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-03-04 17:00:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-03-04 17:00:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-03-04 17:00:37,782 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-03-04 17:00:37,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:37,782 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-03-04 17:00:37,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-03-04 17:00:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-03-04 17:00:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-03-04 17:00:37,784 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:37,784 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-03-04 17:00:37,785 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:00:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-03-04 17:00:37,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:37,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:37,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:37,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:37,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:40,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:40,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:40,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:40,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:40,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:40,097 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-03-04 17:00:40,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:40,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:40,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 218 conjunts are in the unsatisfiable core [2019-03-04 17:00:40,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:40,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:00:40,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:40,332 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:40,333 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:43,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:47,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:47,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-03-04 17:00:47,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:47,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-03-04 17:00:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-03-04 17:00:47,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 17:00:47,180 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-03-04 17:00:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:51,840 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-03-04 17:00:51,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 17:00:51,841 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-03-04 17:00:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:51,842 INFO L225 Difference]: With dead ends: 350 [2019-03-04 17:00:51,842 INFO L226 Difference]: Without dead ends: 349 [2019-03-04 17:00:51,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-03-04 17:00:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-03-04 17:00:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-03-04 17:00:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-03-04 17:00:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-03-04 17:00:51,927 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-03-04 17:00:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:51,927 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-03-04 17:00:51,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-03-04 17:00:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-03-04 17:00:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-03-04 17:00:51,928 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:51,928 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-03-04 17:00:51,929 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:00:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:51,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-03-04 17:00:51,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:51,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:51,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:51,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:51,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:54,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:54,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:54,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:54,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:54,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:54,226 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-03-04 17:00:54,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:00:54,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:54,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-03-04 17:00:54,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:54,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 223 conjunts are in the unsatisfiable core [2019-03-04 17:00:54,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:54,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:00:54,791 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:54,799 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:54,799 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:57,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:01,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:01,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-03-04 17:01:01,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:01,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-03-04 17:01:01,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-03-04 17:01:01,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 17:01:01,883 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-03-04 17:01:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:06,513 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-03-04 17:01:06,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-03-04 17:01:06,513 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-03-04 17:01:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:06,514 INFO L225 Difference]: With dead ends: 355 [2019-03-04 17:01:06,514 INFO L226 Difference]: Without dead ends: 354 [2019-03-04 17:01:06,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-03-04 17:01:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-03-04 17:01:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-03-04 17:01:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-03-04 17:01:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-03-04 17:01:06,605 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-03-04 17:01:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:06,605 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-03-04 17:01:06,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-03-04 17:01:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-03-04 17:01:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-03-04 17:01:06,607 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:06,607 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-03-04 17:01:06,607 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:01:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-03-04 17:01:06,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:06,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:06,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:08,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:08,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:08,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:08,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:08,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:08,994 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-03-04 17:01:09,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:01:09,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:01:09,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:01:09,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:09,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 226 conjunts are in the unsatisfiable core [2019-03-04 17:01:09,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:09,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:01:09,281 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:09,361 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:09,362 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:12,475 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:16,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:16,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-03-04 17:01:16,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:16,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-03-04 17:01:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-03-04 17:01:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 17:01:16,547 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-03-04 17:01:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:21,489 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-03-04 17:01:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-03-04 17:01:21,489 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-03-04 17:01:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:21,490 INFO L225 Difference]: With dead ends: 360 [2019-03-04 17:01:21,490 INFO L226 Difference]: Without dead ends: 359 [2019-03-04 17:01:21,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-03-04 17:01:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-03-04 17:01:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-03-04 17:01:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-03-04 17:01:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-03-04 17:01:21,580 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-03-04 17:01:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:21,581 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-03-04 17:01:21,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-03-04 17:01:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-03-04 17:01:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-03-04 17:01:21,582 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:21,582 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-03-04 17:01:21,582 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:01:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-03-04 17:01:21,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:21,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:21,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:24,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:24,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:24,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:24,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:24,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:24,043 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-03-04 17:01:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:24,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:24,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 227 conjunts are in the unsatisfiable core [2019-03-04 17:01:24,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:24,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:01:24,280 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:24,288 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:24,288 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:27,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:31,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:31,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-03-04 17:01:31,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:31,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-03-04 17:01:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-03-04 17:01:31,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 17:01:31,559 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-03-04 17:01:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:36,555 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-03-04 17:01:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 17:01:36,555 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-03-04 17:01:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:36,556 INFO L225 Difference]: With dead ends: 365 [2019-03-04 17:01:36,557 INFO L226 Difference]: Without dead ends: 364 [2019-03-04 17:01:36,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-03-04 17:01:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-03-04 17:01:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-03-04 17:01:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-03-04 17:01:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-03-04 17:01:36,652 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-03-04 17:01:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:36,652 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-03-04 17:01:36,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-03-04 17:01:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-03-04 17:01:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-03-04 17:01:36,653 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:36,653 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-03-04 17:01:36,654 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:01:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-03-04 17:01:36,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:36,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:36,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:36,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:36,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:39,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:39,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:39,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:39,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:39,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:39,152 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-03-04 17:01:39,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:01:39,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:01:39,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-03-04 17:01:39,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:39,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 232 conjunts are in the unsatisfiable core [2019-03-04 17:01:39,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:39,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:01:39,783 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:39,791 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:39,791 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:43,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:47,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:47,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-03-04 17:01:47,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:47,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-03-04 17:01:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-03-04 17:01:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 17:01:47,157 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-03-04 17:01:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:52,188 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-03-04 17:01:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 17:01:52,188 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-03-04 17:01:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:52,190 INFO L225 Difference]: With dead ends: 370 [2019-03-04 17:01:52,190 INFO L226 Difference]: Without dead ends: 369 [2019-03-04 17:01:52,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-03-04 17:01:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-03-04 17:01:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-03-04 17:01:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-03-04 17:01:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-03-04 17:01:52,285 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-03-04 17:01:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:52,285 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-03-04 17:01:52,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-03-04 17:01:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-03-04 17:01:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-03-04 17:01:52,286 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:52,287 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-03-04 17:01:52,287 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:01:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-03-04 17:01:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:52,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:52,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:54,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:54,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:54,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:54,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:54,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:54,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:01:54,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:01:54,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:01:55,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:01:55,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:55,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 235 conjunts are in the unsatisfiable core [2019-03-04 17:01:55,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:55,107 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:01:55,107 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:55,115 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:55,115 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:58,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:02,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:02,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-03-04 17:02:02,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:02,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-03-04 17:02:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-03-04 17:02:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 17:02:02,587 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-03-04 17:02:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:07,752 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-03-04 17:02:07,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-03-04 17:02:07,752 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-03-04 17:02:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:07,754 INFO L225 Difference]: With dead ends: 375 [2019-03-04 17:02:07,754 INFO L226 Difference]: Without dead ends: 374 [2019-03-04 17:02:07,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-03-04 17:02:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-03-04 17:02:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-03-04 17:02:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-03-04 17:02:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-03-04 17:02:07,854 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-03-04 17:02:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:07,854 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-03-04 17:02:07,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-03-04 17:02:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-03-04 17:02:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-03-04 17:02:07,856 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:07,856 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-03-04 17:02:07,856 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:02:07,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:07,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-03-04 17:02:07,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:07,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:07,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:07,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:07,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:10,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:10,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:10,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:10,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:10,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:10,500 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-03-04 17:02:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:10,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:02:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:10,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 236 conjunts are in the unsatisfiable core [2019-03-04 17:02:10,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:10,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:02:10,743 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:10,751 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:10,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:14,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:18,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:18,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-03-04 17:02:18,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:18,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-03-04 17:02:18,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-03-04 17:02:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 17:02:18,292 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-03-04 17:02:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:23,696 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-03-04 17:02:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-03-04 17:02:23,696 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-03-04 17:02:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:23,698 INFO L225 Difference]: With dead ends: 380 [2019-03-04 17:02:23,698 INFO L226 Difference]: Without dead ends: 379 [2019-03-04 17:02:23,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-03-04 17:02:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-03-04 17:02:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-03-04 17:02:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-03-04 17:02:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-03-04 17:02:23,802 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-03-04 17:02:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:23,803 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-03-04 17:02:23,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-03-04 17:02:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-03-04 17:02:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-03-04 17:02:23,804 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:23,804 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-03-04 17:02:23,804 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:02:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-03-04 17:02:23,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:23,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:23,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:26,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:26,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:26,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:26,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:26,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:26,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:02:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:02:26,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:02:27,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-03-04 17:02:27,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:27,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 241 conjunts are in the unsatisfiable core [2019-03-04 17:02:27,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:27,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:02:27,190 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:27,202 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:27,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:30,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:34,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:34,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-03-04 17:02:34,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:34,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-03-04 17:02:34,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-03-04 17:02:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 17:02:34,935 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-03-04 17:02:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:40,312 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-03-04 17:02:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-03-04 17:02:40,312 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-03-04 17:02:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:40,314 INFO L225 Difference]: With dead ends: 385 [2019-03-04 17:02:40,314 INFO L226 Difference]: Without dead ends: 384 [2019-03-04 17:02:40,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-03-04 17:02:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-03-04 17:02:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-03-04 17:02:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-03-04 17:02:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-03-04 17:02:40,421 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-03-04 17:02:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:40,421 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-03-04 17:02:40,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-03-04 17:02:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-03-04 17:02:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-03-04 17:02:40,423 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:40,423 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-03-04 17:02:40,423 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:02:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-03-04 17:02:40,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:40,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:40,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:40,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:40,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:43,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:43,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:43,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:43,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:43,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:43,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:02:43,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:02:43,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:02:43,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:02:43,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:43,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 244 conjunts are in the unsatisfiable core [2019-03-04 17:02:43,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:43,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:02:43,497 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:43,506 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:43,506 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:47,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:51,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:51,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-03-04 17:02:51,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:51,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-03-04 17:02:51,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-03-04 17:02:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-03-04 17:02:51,287 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-03-04 17:02:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:56,793 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-03-04 17:02:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 17:02:56,793 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-03-04 17:02:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:56,795 INFO L225 Difference]: With dead ends: 390 [2019-03-04 17:02:56,795 INFO L226 Difference]: Without dead ends: 389 [2019-03-04 17:02:56,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-03-04 17:02:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-03-04 17:02:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-03-04 17:02:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-03-04 17:02:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-03-04 17:02:56,904 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-03-04 17:02:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:56,904 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-03-04 17:02:56,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-03-04 17:02:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-03-04 17:02:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-03-04 17:02:56,906 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:56,906 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-03-04 17:02:56,906 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:02:56,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-03-04 17:02:56,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:56,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:56,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:56,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:56,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:59,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:59,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:59,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:59,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:59,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:59,861 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-03-04 17:02:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:59,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:03:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:00,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 245 conjunts are in the unsatisfiable core [2019-03-04 17:03:00,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:00,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:03:00,117 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:00,127 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:00,127 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:03,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:07,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:07,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-03-04 17:03:08,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:08,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-03-04 17:03:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-03-04 17:03:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 17:03:08,002 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-03-04 17:03:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:13,748 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-03-04 17:03:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-03-04 17:03:13,749 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-03-04 17:03:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:13,750 INFO L225 Difference]: With dead ends: 395 [2019-03-04 17:03:13,750 INFO L226 Difference]: Without dead ends: 394 [2019-03-04 17:03:13,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-03-04 17:03:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-03-04 17:03:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-03-04 17:03:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-03-04 17:03:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-03-04 17:03:13,862 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-03-04 17:03:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:13,862 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-03-04 17:03:13,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-03-04 17:03:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-03-04 17:03:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-03-04 17:03:13,863 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:13,864 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-03-04 17:03:13,864 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:03:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-03-04 17:03:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:13,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:13,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:16,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:16,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:16,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:16,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:16,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:16,761 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-03-04 17:03:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:03:16,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:03:17,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-03-04 17:03:17,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:17,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 250 conjunts are in the unsatisfiable core [2019-03-04 17:03:17,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:17,471 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:03:17,472 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:17,485 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:17,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:21,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:25,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-03-04 17:03:25,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:25,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-03-04 17:03:25,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-03-04 17:03:25,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-03-04 17:03:25,427 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-03-04 17:03:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:31,261 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-03-04 17:03:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-03-04 17:03:31,261 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-03-04 17:03:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:31,263 INFO L225 Difference]: With dead ends: 400 [2019-03-04 17:03:31,263 INFO L226 Difference]: Without dead ends: 399 [2019-03-04 17:03:31,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-03-04 17:03:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-03-04 17:03:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-03-04 17:03:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-03-04 17:03:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-03-04 17:03:31,377 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-03-04 17:03:31,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:31,377 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-03-04 17:03:31,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-03-04 17:03:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-03-04 17:03:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-03-04 17:03:31,379 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:31,379 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-03-04 17:03:31,379 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:03:31,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:31,379 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-03-04 17:03:31,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:31,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:31,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:34,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:34,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:34,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:34,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:34,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:34,370 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-03-04 17:03:34,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:03:34,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:03:34,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:03:34,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:34,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 253 conjunts are in the unsatisfiable core [2019-03-04 17:03:34,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:34,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:03:34,657 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:34,668 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:34,668 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:38,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:42,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:42,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-03-04 17:03:42,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:42,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-03-04 17:03:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-03-04 17:03:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 17:03:42,679 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-03-04 17:03:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:48,655 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-03-04 17:03:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 17:03:48,655 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-03-04 17:03:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:48,657 INFO L225 Difference]: With dead ends: 405 [2019-03-04 17:03:48,657 INFO L226 Difference]: Without dead ends: 404 [2019-03-04 17:03:48,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-03-04 17:03:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-03-04 17:03:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-03-04 17:03:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-03-04 17:03:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-03-04 17:03:48,777 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-03-04 17:03:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:48,777 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-03-04 17:03:48,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-03-04 17:03:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-03-04 17:03:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-03-04 17:03:48,779 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:48,779 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-03-04 17:03:48,779 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:03:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-03-04 17:03:48,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:48,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:48,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:51,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:51,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:51,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:51,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:51,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:51,851 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-03-04 17:03:51,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:51,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:03:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:52,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 254 conjunts are in the unsatisfiable core [2019-03-04 17:03:52,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:52,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:03:52,142 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:52,151 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:52,151 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:56,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-03-04 17:03:56,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:00,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-03-04 17:04:00,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-03-04 17:04:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-03-04 17:04:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 17:04:00,349 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-03-04 17:04:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:06,342 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-03-04 17:04:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 17:04:06,343 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-03-04 17:04:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:06,344 INFO L225 Difference]: With dead ends: 410 [2019-03-04 17:04:06,344 INFO L226 Difference]: Without dead ends: 409 [2019-03-04 17:04:06,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-03-04 17:04:06,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-03-04 17:04:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-03-04 17:04:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-03-04 17:04:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-03-04 17:04:06,467 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-03-04 17:04:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:06,467 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-03-04 17:04:06,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-03-04 17:04:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-03-04 17:04:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-03-04 17:04:06,468 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:06,469 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-03-04 17:04:06,469 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:04:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-03-04 17:04:06,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:06,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:06,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:06,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:09,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:09,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:09,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:09,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:09,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:09,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:04:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:04:09,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:04:10,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-03-04 17:04:10,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:10,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1714 conjuncts, 259 conjunts are in the unsatisfiable core [2019-03-04 17:04:10,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:10,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:04:10,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:10,408 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:10,408 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:14,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:18,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:18,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-03-04 17:04:18,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:18,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-03-04 17:04:18,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-03-04 17:04:18,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 17:04:18,633 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-03-04 17:04:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:24,980 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-03-04 17:04:24,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-03-04 17:04:24,980 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-03-04 17:04:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:24,982 INFO L225 Difference]: With dead ends: 415 [2019-03-04 17:04:24,982 INFO L226 Difference]: Without dead ends: 414 [2019-03-04 17:04:24,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-03-04 17:04:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-03-04 17:04:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-03-04 17:04:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-03-04 17:04:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-03-04 17:04:25,107 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-03-04 17:04:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:25,108 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-03-04 17:04:25,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-03-04 17:04:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-03-04 17:04:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-03-04 17:04:25,109 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:25,110 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-03-04 17:04:25,110 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:04:25,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-03-04 17:04:25,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:25,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:25,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:28,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:28,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:28,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:28,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:28,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:28,338 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-03-04 17:04:28,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:04:28,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:04:28,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:04:28,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:28,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 262 conjunts are in the unsatisfiable core [2019-03-04 17:04:28,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:28,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:04:28,638 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:28,648 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:28,648 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:32,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:37,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:37,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-03-04 17:04:37,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:37,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-03-04 17:04:37,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-03-04 17:04:37,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-03-04 17:04:37,044 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-03-04 17:04:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:43,377 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-03-04 17:04:43,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 17:04:43,377 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-03-04 17:04:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:43,378 INFO L225 Difference]: With dead ends: 420 [2019-03-04 17:04:43,379 INFO L226 Difference]: Without dead ends: 419 [2019-03-04 17:04:43,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-03-04 17:04:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-03-04 17:04:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-03-04 17:04:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-03-04 17:04:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-03-04 17:04:43,508 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-03-04 17:04:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:43,508 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-03-04 17:04:43,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-03-04 17:04:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-03-04 17:04:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-03-04 17:04:43,510 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:43,510 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-03-04 17:04:43,510 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:04:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-03-04 17:04:43,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:43,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:43,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:43,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:46,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:46,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:46,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:46,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:46,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:46,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:04:46,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:46,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:04:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:47,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 263 conjunts are in the unsatisfiable core [2019-03-04 17:04:47,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:47,074 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:04:47,074 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:47,082 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:47,082 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:51,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:55,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:55,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-03-04 17:04:55,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:55,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-03-04 17:04:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-03-04 17:04:55,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 17:04:55,545 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-03-04 17:05:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:05:02,020 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-03-04 17:05:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-03-04 17:05:02,020 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-03-04 17:05:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:05:02,022 INFO L225 Difference]: With dead ends: 425 [2019-03-04 17:05:02,022 INFO L226 Difference]: Without dead ends: 424 [2019-03-04 17:05:02,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-03-04 17:05:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-03-04 17:05:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-03-04 17:05:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-03-04 17:05:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-03-04 17:05:02,156 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-03-04 17:05:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:05:02,157 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-03-04 17:05:02,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-03-04 17:05:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-03-04 17:05:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-03-04 17:05:02,159 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:05:02,159 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-03-04 17:05:02,159 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:05:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:05:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-03-04 17:05:02,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:05:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:02,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:05:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:02,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:05:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:05:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:05,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:05,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:05:05,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:05:05,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:05:05,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:05,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:05:05,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:05:05,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:05:06,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-03-04 17:05:06,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:05:06,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 268 conjunts are in the unsatisfiable core [2019-03-04 17:05:06,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:05:06,670 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:05:06,670 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:05:06,678 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:05:06,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:05:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:10,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:05:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:15,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:05:15,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-03-04 17:05:15,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:05:15,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-03-04 17:05:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-03-04 17:05:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-03-04 17:05:15,210 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-03-04 17:05:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:05:21,894 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-03-04 17:05:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-03-04 17:05:21,894 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-03-04 17:05:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:05:21,896 INFO L225 Difference]: With dead ends: 430 [2019-03-04 17:05:21,896 INFO L226 Difference]: Without dead ends: 429 [2019-03-04 17:05:21,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-03-04 17:05:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-03-04 17:05:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-03-04 17:05:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-03-04 17:05:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-03-04 17:05:22,032 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-03-04 17:05:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:05:22,033 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-03-04 17:05:22,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-03-04 17:05:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-03-04 17:05:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-03-04 17:05:22,035 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:05:22,035 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-03-04 17:05:22,035 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:05:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:05:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-03-04 17:05:22,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:05:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:22,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:05:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:22,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:05:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:05:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:25,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:25,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:05:25,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:05:25,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:05:25,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:25,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:05:25,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:05:25,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:05:25,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:05:25,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:05:25,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 271 conjunts are in the unsatisfiable core [2019-03-04 17:05:25,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:05:25,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 17:05:25,768 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:05:25,772 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:05:25,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:05:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:30,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:05:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:34,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:05:34,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-03-04 17:05:34,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:05:34,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-03-04 17:05:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-03-04 17:05:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13829, Invalid=22081, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 17:05:34,438 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-03-04 17:05:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:05:41,193 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-03-04 17:05:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-03-04 17:05:41,193 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-03-04 17:05:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:05:41,195 INFO L225 Difference]: With dead ends: 435 [2019-03-04 17:05:41,195 INFO L226 Difference]: Without dead ends: 434 [2019-03-04 17:05:41,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 676 SyntacticMatches, 70 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35139 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=26597, Invalid=49303, Unknown=0, NotChecked=0, Total=75900 [2019-03-04 17:05:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-03-04 17:05:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-03-04 17:05:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-03-04 17:05:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-03-04 17:05:41,335 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-03-04 17:05:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:05:41,336 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-03-04 17:05:41,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-03-04 17:05:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-03-04 17:05:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-03-04 17:05:41,337 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:05:41,337 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-03-04 17:05:41,338 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 17:05:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:05:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-03-04 17:05:41,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:05:41,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:41,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:05:41,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:41,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:05:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat