java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 13:52:05,784 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:52:05,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:52:05,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:52:05,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:52:05,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:52:05,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:52:05,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:52:05,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:52:05,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:52:05,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:52:05,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:52:05,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:52:05,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:52:05,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:52:05,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:52:05,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:52:05,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:52:05,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:52:05,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:52:05,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:52:05,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:52:05,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:52:05,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:52:05,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:52:05,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:52:05,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:52:05,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:52:05,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:52:05,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:52:05,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:52:05,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:52:05,857 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:52:05,857 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:52:05,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:52:05,860 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:52:05,860 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 13:52:05,887 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:52:05,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:52:05,893 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:52:05,894 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:52:05,894 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:52:05,894 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:52:05,894 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:52:05,895 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:52:05,895 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:52:05,895 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:52:05,895 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:52:05,895 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:52:05,898 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:52:05,898 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:52:05,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:52:05,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:52:05,899 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:52:05,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:52:05,900 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:52:05,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:52:05,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:52:05,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:52:05,901 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:52:05,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:52:05,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:52:05,901 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:52:05,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:52:05,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:52:05,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:52:05,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:52:05,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:52:05,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:52:05,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:52:05,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:52:05,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:52:05,905 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:52:05,905 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:52:05,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:52:05,906 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:52:05,906 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:52:05,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:52:05,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:52:05,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:52:05,985 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:52:05,985 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:52:05,986 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-01-08 13:52:05,986 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-01-08 13:52:06,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:52:06,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:52:06,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:52:06,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:52:06,027 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:52:06,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,067 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-08 13:52:06,067 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-08 13:52:06,067 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-08 13:52:06,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:52:06,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:52:06,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:52:06,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:52:06,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... [2019-01-08 13:52:06,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:52:06,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:52:06,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:52:06,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:52:06,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:52:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-08 13:52:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-08 13:52:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-08 13:52:06,486 INFO L278 CfgBuilder]: Using library mode [2019-01-08 13:52:06,486 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-08 13:52:06,487 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:52:06 BoogieIcfgContainer [2019-01-08 13:52:06,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:52:06,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:52:06,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:52:06,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:52:06,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:06" (1/2) ... [2019-01-08 13:52:06,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eafebbf and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:52:06, skipping insertion in model container [2019-01-08 13:52:06,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:52:06" (2/2) ... [2019-01-08 13:52:06,498 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-01-08 13:52:06,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:52:06,520 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 13:52:06,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 13:52:06,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:52:06,579 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:52:06,579 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:52:06,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:52:06,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:52:06,579 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:52:06,580 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:52:06,580 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:52:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-08 13:52:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 13:52:06,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:06,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 13:52:06,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-08 13:52:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:06,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:06,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:52:06,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 13:52:06,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:52:06,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:52:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:52:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:52:06,875 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-08 13:52:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:07,016 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-08 13:52:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:52:07,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 13:52:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:07,029 INFO L225 Difference]: With dead ends: 15 [2019-01-08 13:52:07,030 INFO L226 Difference]: Without dead ends: 8 [2019-01-08 13:52:07,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:52:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-08 13:52:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-08 13:52:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 13:52:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-08 13:52:07,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-01-08 13:52:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:07,070 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-08 13:52:07,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:52:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-08 13:52:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:52:07,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:07,071 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 13:52:07,072 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2019-01-08 13:52:07,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:07,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:07,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 13:52:07,197 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2019-01-08 13:52:07,238 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:52:07,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:52:07,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:52:07,410 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 3. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 13:52:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:07,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:52:07,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:07,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:07,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:07,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:07,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:07,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:07,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:07,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:07,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 13:52:07,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:07,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 13:52:07,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 13:52:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:52:07,947 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-08 13:52:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:08,011 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-08 13:52:08,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 13:52:08,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-08 13:52:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:08,012 INFO L225 Difference]: With dead ends: 12 [2019-01-08 13:52:08,013 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 13:52:08,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:52:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 13:52:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-08 13:52:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-08 13:52:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-08 13:52:08,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-01-08 13:52:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:08,018 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-08 13:52:08,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 13:52:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-08 13:52:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 13:52:08,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:08,019 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-01-08 13:52:08,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2019-01-08 13:52:08,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:08,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:08,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:08,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:08,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:08,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:08,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:08,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:08,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:08,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:08,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 13:52:08,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:08,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:08,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:08,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:08,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:08,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:08,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 13:52:08,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:08,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 13:52:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 13:52:08,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-08 13:52:08,718 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-01-08 13:52:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:08,870 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-08 13:52:08,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:52:08,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-08 13:52:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:08,874 INFO L225 Difference]: With dead ends: 15 [2019-01-08 13:52:08,874 INFO L226 Difference]: Without dead ends: 14 [2019-01-08 13:52:08,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-08 13:52:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-08 13:52:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-08 13:52:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 13:52:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-08 13:52:08,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-01-08 13:52:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:08,880 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-08 13:52:08,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 13:52:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-08 13:52:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-08 13:52:08,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:08,881 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-01-08 13:52:08,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2019-01-08 13:52:08,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:08,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:08,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:08,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:08,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:08,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:08,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:08,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:09,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:09,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:09,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:09,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:09,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:09,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:09,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:09,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:09,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:09,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 13:52:09,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:09,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 13:52:09,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 13:52:09,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:52:09,320 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-01-08 13:52:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:09,692 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-08 13:52:09,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 13:52:09,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-01-08 13:52:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:09,694 INFO L225 Difference]: With dead ends: 18 [2019-01-08 13:52:09,694 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 13:52:09,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:52:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 13:52:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-08 13:52:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 13:52:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-08 13:52:09,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-01-08 13:52:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:09,700 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-08 13:52:09,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 13:52:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-08 13:52:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-08 13:52:09,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:09,701 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-01-08 13:52:09,701 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2019-01-08 13:52:09,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:09,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:09,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:09,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:09,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:09,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:09,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:09,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:09,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:09,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:09,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:09,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:10,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 13:52:10,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:10,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 13:52:10,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 13:52:10,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-08 13:52:10,151 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-01-08 13:52:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:10,216 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-08 13:52:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 13:52:10,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-01-08 13:52:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:10,218 INFO L225 Difference]: With dead ends: 21 [2019-01-08 13:52:10,218 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 13:52:10,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-08 13:52:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 13:52:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-08 13:52:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 13:52:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-08 13:52:10,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-01-08 13:52:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:10,223 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-08 13:52:10,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 13:52:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-08 13:52:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-08 13:52:10,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:10,224 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-01-08 13:52:10,224 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2019-01-08 13:52:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:10,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:10,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:10,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:10,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:10,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:10,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-08 13:52:10,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:10,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:10,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:10,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:10,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:10,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:10,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-08 13:52:10,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:10,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 13:52:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 13:52:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:52:10,788 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2019-01-08 13:52:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:10,845 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-08 13:52:10,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 13:52:10,846 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-01-08 13:52:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:10,847 INFO L225 Difference]: With dead ends: 24 [2019-01-08 13:52:10,847 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 13:52:10,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:52:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 13:52:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-08 13:52:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 13:52:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-08 13:52:10,853 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-01-08 13:52:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:10,853 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-08 13:52:10,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 13:52:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-08 13:52:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-08 13:52:10,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:10,855 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-01-08 13:52:10,855 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2019-01-08 13:52:10,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:10,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:10,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:11,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:11,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:11,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:11,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:11,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:11,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:11,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:11,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:11,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:11,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:11,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-08 13:52:11,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:11,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-08 13:52:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-08 13:52:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-08 13:52:11,497 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2019-01-08 13:52:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:11,581 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-08 13:52:11,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 13:52:11,582 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-01-08 13:52:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:11,584 INFO L225 Difference]: With dead ends: 27 [2019-01-08 13:52:11,584 INFO L226 Difference]: Without dead ends: 26 [2019-01-08 13:52:11,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-08 13:52:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-08 13:52:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-08 13:52:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 13:52:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-08 13:52:11,589 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-01-08 13:52:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:11,590 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-08 13:52:11,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-08 13:52:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-08 13:52:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-08 13:52:11,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:11,591 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-01-08 13:52:11,591 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2019-01-08 13:52:11,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:11,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:11,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:11,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:11,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:11,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:11,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:11,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:11,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:11,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:11,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:11,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:11,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:12,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-08 13:52:12,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:12,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-08 13:52:12,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-08 13:52:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:52:12,241 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-01-08 13:52:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:12,463 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-08 13:52:12,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 13:52:12,464 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-01-08 13:52:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:12,465 INFO L225 Difference]: With dead ends: 30 [2019-01-08 13:52:12,465 INFO L226 Difference]: Without dead ends: 29 [2019-01-08 13:52:12,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:52:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-08 13:52:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-08 13:52:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 13:52:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-08 13:52:12,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-01-08 13:52:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:12,474 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-08 13:52:12,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-08 13:52:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-08 13:52:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-08 13:52:12,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:12,475 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-01-08 13:52:12,476 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2019-01-08 13:52:12,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:12,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:12,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:12,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:12,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:12,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:12,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:12,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-08 13:52:12,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:12,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:12,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:12,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:12,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:12,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:13,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:13,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-08 13:52:13,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:13,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-08 13:52:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-08 13:52:13,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-08 13:52:13,226 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-01-08 13:52:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:13,374 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-08 13:52:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 13:52:13,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-01-08 13:52:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:13,376 INFO L225 Difference]: With dead ends: 33 [2019-01-08 13:52:13,376 INFO L226 Difference]: Without dead ends: 32 [2019-01-08 13:52:13,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-08 13:52:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-08 13:52:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-08 13:52:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 13:52:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-08 13:52:13,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-01-08 13:52:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:13,382 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-08 13:52:13,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-08 13:52:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-08 13:52:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 13:52:13,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:13,383 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-01-08 13:52:13,383 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2019-01-08 13:52:13,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:13,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:13,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:13,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:13,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:13,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:13,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:13,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:13,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:13,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:13,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:13,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:13,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:13,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:13,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:13,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:13,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:13,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:13,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:14,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:14,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-08 13:52:14,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:14,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-08 13:52:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-08 13:52:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:52:14,666 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2019-01-08 13:52:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:14,821 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-08 13:52:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 13:52:14,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-08 13:52:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:14,823 INFO L225 Difference]: With dead ends: 36 [2019-01-08 13:52:14,823 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 13:52:14,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:52:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 13:52:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-08 13:52:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-08 13:52:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-08 13:52:14,829 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-01-08 13:52:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:14,830 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-08 13:52:14,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-08 13:52:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-08 13:52:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-08 13:52:14,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:14,831 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-01-08 13:52:14,831 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2019-01-08 13:52:14,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:15,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:15,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:15,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:15,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:15,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:15,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:15,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:15,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:15,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:15,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:16,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-08 13:52:16,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:16,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 13:52:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 13:52:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-08 13:52:16,045 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2019-01-08 13:52:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:16,151 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-08 13:52:16,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 13:52:16,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-01-08 13:52:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:16,154 INFO L225 Difference]: With dead ends: 39 [2019-01-08 13:52:16,154 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 13:52:16,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-08 13:52:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 13:52:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-08 13:52:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 13:52:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-08 13:52:16,159 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-01-08 13:52:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:16,160 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-08 13:52:16,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 13:52:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-08 13:52:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-08 13:52:16,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:16,161 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-01-08 13:52:16,161 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2019-01-08 13:52:16,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:16,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:16,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:16,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:16,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:16,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:16,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:16,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:16,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:16,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:16,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-08 13:52:16,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:16,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:16,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:16,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:16,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:16,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:17,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-08 13:52:17,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:17,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 13:52:17,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 13:52:17,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:17,028 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2019-01-08 13:52:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:17,121 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-08 13:52:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-08 13:52:17,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-01-08 13:52:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:17,123 INFO L225 Difference]: With dead ends: 42 [2019-01-08 13:52:17,123 INFO L226 Difference]: Without dead ends: 41 [2019-01-08 13:52:17,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-08 13:52:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-08 13:52:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 13:52:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-08 13:52:17,129 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-01-08 13:52:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:17,130 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-08 13:52:17,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 13:52:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-08 13:52:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-08 13:52:17,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:17,131 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-01-08 13:52:17,131 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:17,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2019-01-08 13:52:17,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:17,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:17,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:17,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:17,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:17,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:17,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:17,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:17,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:17,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:17,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:17,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:17,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:17,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:18,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-08 13:52:18,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:18,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-08 13:52:18,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-08 13:52:18,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-08 13:52:18,394 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2019-01-08 13:52:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:18,509 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-08 13:52:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 13:52:18,509 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-01-08 13:52:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:18,510 INFO L225 Difference]: With dead ends: 45 [2019-01-08 13:52:18,510 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 13:52:18,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-08 13:52:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 13:52:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-01-08 13:52:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-08 13:52:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-08 13:52:18,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-01-08 13:52:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:18,516 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-08 13:52:18,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-08 13:52:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-08 13:52:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-08 13:52:18,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:18,517 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-01-08 13:52:18,517 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:18,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2019-01-08 13:52:18,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:18,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:18,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:18,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:18,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:18,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:18,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:18,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:18,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:18,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:18,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:18,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:18,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:18,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:18,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:18,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:19,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:20,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-08 13:52:20,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:20,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-08 13:52:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-08 13:52:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:20,174 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2019-01-08 13:52:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:20,291 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-08 13:52:20,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 13:52:20,292 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-01-08 13:52:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:20,293 INFO L225 Difference]: With dead ends: 48 [2019-01-08 13:52:20,293 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 13:52:20,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 13:52:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-08 13:52:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-08 13:52:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-08 13:52:20,299 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-01-08 13:52:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:20,300 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-08 13:52:20,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-08 13:52:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-08 13:52:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-08 13:52:20,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:20,301 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-01-08 13:52:20,301 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:20,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2019-01-08 13:52:20,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:20,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:20,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:20,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:20,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:20,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:20,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-08 13:52:20,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:20,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:20,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:20,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:20,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:20,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:21,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:22,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:22,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-08 13:52:22,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:22,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 13:52:22,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 13:52:22,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-08 13:52:22,265 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2019-01-08 13:52:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:22,546 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-08 13:52:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-08 13:52:22,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-01-08 13:52:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:22,548 INFO L225 Difference]: With dead ends: 51 [2019-01-08 13:52:22,548 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 13:52:22,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-08 13:52:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 13:52:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-01-08 13:52:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 13:52:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-08 13:52:22,561 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-01-08 13:52:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:22,561 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-08 13:52:22,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 13:52:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-08 13:52:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 13:52:22,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:22,563 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-01-08 13:52:22,566 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2019-01-08 13:52:22,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:22,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:22,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:22,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:22,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:22,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:22,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:22,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:22,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:22,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:22,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:22,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:22,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:22,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:22,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:22,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:22,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:22,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:24,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:24,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-08 13:52:24,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:24,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-08 13:52:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-08 13:52:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:24,077 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2019-01-08 13:52:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:24,205 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-08 13:52:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 13:52:24,205 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-01-08 13:52:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:24,206 INFO L225 Difference]: With dead ends: 54 [2019-01-08 13:52:24,206 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 13:52:24,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 13:52:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-08 13:52:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 13:52:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-08 13:52:24,213 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-01-08 13:52:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:24,213 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-08 13:52:24,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-08 13:52:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-08 13:52:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-08 13:52:24,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:24,214 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-01-08 13:52:24,214 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2019-01-08 13:52:24,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:25,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:25,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:25,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:25,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:25,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:25,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:25,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:25,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:25,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:25,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:25,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:26,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:27,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:27,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-08 13:52:27,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:27,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-08 13:52:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-08 13:52:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 13:52:27,422 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2019-01-08 13:52:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:27,555 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-08 13:52:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 13:52:27,555 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-01-08 13:52:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:27,556 INFO L225 Difference]: With dead ends: 57 [2019-01-08 13:52:27,556 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 13:52:27,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 13:52:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 13:52:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-01-08 13:52:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 13:52:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-08 13:52:27,564 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-01-08 13:52:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:27,564 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-08 13:52:27,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-08 13:52:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-08 13:52:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-08 13:52:27,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:27,566 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-01-08 13:52:27,566 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:27,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2019-01-08 13:52:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:28,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:28,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:28,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:28,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:28,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:28,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:28,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:28,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-08 13:52:28,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:28,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:28,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:28,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:28,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:28,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:29,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-08 13:52:29,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:29,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 13:52:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 13:52:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:29,486 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2019-01-08 13:52:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:29,613 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-08 13:52:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 13:52:29,614 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-01-08 13:52:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:29,615 INFO L225 Difference]: With dead ends: 60 [2019-01-08 13:52:29,615 INFO L226 Difference]: Without dead ends: 59 [2019-01-08 13:52:29,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-08 13:52:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-08 13:52:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-08 13:52:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-08 13:52:29,621 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-01-08 13:52:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:29,621 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-08 13:52:29,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 13:52:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-08 13:52:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-08 13:52:29,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:29,622 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-01-08 13:52:29,623 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2019-01-08 13:52:29,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:30,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:30,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:30,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:30,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:30,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:30,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:30,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:30,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:30,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:30,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:30,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:30,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:30,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:30,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:31,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-08 13:52:31,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:31,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-08 13:52:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-08 13:52:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 13:52:31,295 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2019-01-08 13:52:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:31,430 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-08 13:52:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-08 13:52:31,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-01-08 13:52:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:31,432 INFO L225 Difference]: With dead ends: 63 [2019-01-08 13:52:31,432 INFO L226 Difference]: Without dead ends: 62 [2019-01-08 13:52:31,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 13:52:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-08 13:52:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-08 13:52:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 13:52:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-08 13:52:31,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-01-08 13:52:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:31,441 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-08 13:52:31,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-08 13:52:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-08 13:52:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-08 13:52:31,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:31,442 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-01-08 13:52:31,443 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2019-01-08 13:52:31,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:31,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:31,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:31,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:31,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:31,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:31,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:31,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:31,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:31,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:31,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:31,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:31,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:32,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:32,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:32,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-08 13:52:32,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:32,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-08 13:52:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-08 13:52:32,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:32,957 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2019-01-08 13:52:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:33,118 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-08 13:52:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 13:52:33,119 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-01-08 13:52:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:33,119 INFO L225 Difference]: With dead ends: 66 [2019-01-08 13:52:33,120 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 13:52:33,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 13:52:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-08 13:52:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-08 13:52:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-08 13:52:33,126 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-01-08 13:52:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:33,127 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-08 13:52:33,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-08 13:52:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-08 13:52:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-08 13:52:33,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:33,128 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-01-08 13:52:33,128 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2019-01-08 13:52:33,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:33,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:33,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:33,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:33,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:33,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:33,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:33,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:33,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:33,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:33,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:33,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-08 13:52:33,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:33,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:33,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:33,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:33,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:33,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:34,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:35,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:35,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-08 13:52:35,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:35,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 13:52:35,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 13:52:35,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 13:52:35,285 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2019-01-08 13:52:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:35,478 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-08 13:52:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-08 13:52:35,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-01-08 13:52:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:35,479 INFO L225 Difference]: With dead ends: 69 [2019-01-08 13:52:35,479 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 13:52:35,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 13:52:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 13:52:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-01-08 13:52:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 13:52:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-08 13:52:35,487 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-01-08 13:52:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:35,487 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-08 13:52:35,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 13:52:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-08 13:52:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-08 13:52:35,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:35,488 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-01-08 13:52:35,489 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:35,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:35,489 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2019-01-08 13:52:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:35,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:35,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:35,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:35,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:36,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:36,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:36,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:36,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:36,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:36,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:36,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:36,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:36,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:36,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:36,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:36,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:36,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:36,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:36,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:36,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:37,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:37,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-08 13:52:37,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:37,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-08 13:52:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-08 13:52:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:37,546 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2019-01-08 13:52:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:37,712 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-08 13:52:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 13:52:37,715 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-01-08 13:52:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:37,715 INFO L225 Difference]: With dead ends: 72 [2019-01-08 13:52:37,716 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 13:52:37,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 13:52:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-01-08 13:52:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-08 13:52:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-08 13:52:37,721 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-01-08 13:52:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:37,721 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-08 13:52:37,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-08 13:52:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-08 13:52:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-08 13:52:37,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:37,722 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-01-08 13:52:37,722 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:37,722 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2019-01-08 13:52:37,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:37,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:37,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:37,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:37,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:38,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:38,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:38,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:38,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:38,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:38,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:38,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:38,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:38,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:38,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:38,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:38,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:38,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:38,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:39,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:39,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-08 13:52:39,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:39,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-08 13:52:39,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-08 13:52:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-08 13:52:39,999 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2019-01-08 13:52:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:40,180 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-08 13:52:40,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-08 13:52:40,181 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-01-08 13:52:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:40,182 INFO L225 Difference]: With dead ends: 75 [2019-01-08 13:52:40,182 INFO L226 Difference]: Without dead ends: 74 [2019-01-08 13:52:40,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-08 13:52:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-08 13:52:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-01-08 13:52:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 13:52:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-08 13:52:40,188 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-01-08 13:52:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:40,188 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-08 13:52:40,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-08 13:52:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-08 13:52:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 13:52:40,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:40,189 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-01-08 13:52:40,190 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2019-01-08 13:52:40,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:40,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:40,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:40,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:40,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:40,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:40,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:40,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:40,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:40,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:40,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-08 13:52:40,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:40,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:40,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:40,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:40,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:40,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:41,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:42,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-08 13:52:42,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:42,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 13:52:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 13:52:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:42,314 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2019-01-08 13:52:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:42,487 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-08 13:52:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 13:52:42,491 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-01-08 13:52:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:42,492 INFO L225 Difference]: With dead ends: 78 [2019-01-08 13:52:42,492 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 13:52:42,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 13:52:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-08 13:52:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-08 13:52:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-08 13:52:42,498 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-01-08 13:52:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:42,498 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-08 13:52:42,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 13:52:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-08 13:52:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-08 13:52:42,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:42,499 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-01-08 13:52:42,500 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:42,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2019-01-08 13:52:42,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:43,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:43,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:43,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:43,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:43,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:43,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:43,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:43,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:43,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:43,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:43,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:43,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:43,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:43,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:43,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:43,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:45,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:45,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-08 13:52:45,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:45,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-08 13:52:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-08 13:52:45,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 13:52:45,133 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2019-01-08 13:52:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:45,337 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-08 13:52:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 13:52:45,337 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-01-08 13:52:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:45,339 INFO L225 Difference]: With dead ends: 81 [2019-01-08 13:52:45,339 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 13:52:45,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 13:52:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 13:52:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-01-08 13:52:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-08 13:52:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-08 13:52:45,344 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-01-08 13:52:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:45,345 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-08 13:52:45,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-08 13:52:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-08 13:52:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-08 13:52:45,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:45,346 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-01-08 13:52:45,346 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2019-01-08 13:52:45,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:45,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:45,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:45,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:45,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:45,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:45,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:45,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:45,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:45,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52: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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:45,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:45,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:45,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:45,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:45,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:45,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:45,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:46,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:47,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:47,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-08 13:52:47,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:47,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-08 13:52:47,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-08 13:52:47,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:47,740 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2019-01-08 13:52:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:47,943 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-08 13:52:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-08 13:52:47,944 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-01-08 13:52:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:47,945 INFO L225 Difference]: With dead ends: 84 [2019-01-08 13:52:47,945 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 13:52:47,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 13:52:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-01-08 13:52:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-08 13:52:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-08 13:52:47,950 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-01-08 13:52:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:47,951 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-08 13:52:47,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-08 13:52:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-08 13:52:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-08 13:52:47,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:47,952 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-01-08 13:52:47,952 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:47,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2019-01-08 13:52:47,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:47,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:47,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:47,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:47,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:48,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:48,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:48,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:48,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:48,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:48,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:48,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:48,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:48,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-08 13:52:48,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:48,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:48,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:48,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:48,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:48,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:49,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:51,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:51,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-08 13:52:51,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:51,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-08 13:52:51,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-08 13:52:51,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-08 13:52:51,018 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2019-01-08 13:52:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:51,182 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-08 13:52:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-08 13:52:51,183 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-01-08 13:52:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:51,184 INFO L225 Difference]: With dead ends: 87 [2019-01-08 13:52:51,184 INFO L226 Difference]: Without dead ends: 86 [2019-01-08 13:52:51,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-08 13:52:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-08 13:52:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-01-08 13:52:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-08 13:52:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-08 13:52:51,189 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-01-08 13:52:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:51,189 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-08 13:52:51,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-08 13:52:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-08 13:52:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-08 13:52:51,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:51,190 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-01-08 13:52:51,190 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2019-01-08 13:52:51,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:51,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:51,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:51,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:51,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:51,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:51,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:51,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:51,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:51,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:51,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:51,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:51,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:51,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:51,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:51,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:51,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:51,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:51,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:51,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:52,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:53,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:53,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-08 13:52:53,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-08 13:52:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-08 13:52:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:53,785 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2019-01-08 13:52:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:53,965 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-08 13:52:53,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 13:52:53,965 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-01-08 13:52:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:53,967 INFO L225 Difference]: With dead ends: 90 [2019-01-08 13:52:53,967 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 13:52:53,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 13:52:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-01-08 13:52:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-08 13:52:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-08 13:52:53,972 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-01-08 13:52:53,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:53,972 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-08 13:52:53,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-08 13:52:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-08 13:52:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-08 13:52:53,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:53,973 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-01-08 13:52:53,974 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2019-01-08 13:52:53,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:53,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:53,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:53,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:53,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:55,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:55,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:55,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:55,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:55,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:55,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:55,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:55,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:55,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:55,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:55,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:55,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:55,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:56,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-08 13:52:57,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:57,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-08 13:52:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-08 13:52:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 13:52:57,562 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2019-01-08 13:52:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:57,769 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-08 13:52:57,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 13:52:57,770 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-01-08 13:52:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:57,771 INFO L225 Difference]: With dead ends: 93 [2019-01-08 13:52:57,771 INFO L226 Difference]: Without dead ends: 92 [2019-01-08 13:52:57,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 13:52:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-08 13:52:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-01-08 13:52:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-08 13:52:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-08 13:52:57,777 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-01-08 13:52:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:57,777 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-08 13:52:57,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-08 13:52:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-08 13:52:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-08 13:52:57,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:57,778 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-01-08 13:52:57,778 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2019-01-08 13:52:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:57,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:57,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:58,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:58,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:58,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:58,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:58,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:58,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:58,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:58,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:58,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-08 13:52:58,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:58,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:58,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:52:58,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:58,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:58,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:59,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:01,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:01,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-08 13:53:01,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:01,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-08 13:53:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-08 13:53:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:01,140 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2019-01-08 13:53:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:01,347 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-08 13:53:01,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 13:53:01,347 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-01-08 13:53:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:01,348 INFO L225 Difference]: With dead ends: 96 [2019-01-08 13:53:01,348 INFO L226 Difference]: Without dead ends: 95 [2019-01-08 13:53:01,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-08 13:53:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-01-08 13:53:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-08 13:53:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-08 13:53:01,354 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-01-08 13:53:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:01,354 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-08 13:53:01,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-08 13:53:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-08 13:53:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-08 13:53:01,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:01,355 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-01-08 13:53:01,355 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2019-01-08 13:53:01,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:01,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:01,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:02,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:02,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:02,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:02,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:02,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:02,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:02,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:02,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:02,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:02,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:02,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:02,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:02,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:02,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:02,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:03,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:04,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-08 13:53:04,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:04,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-08 13:53:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-08 13:53:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 13:53:04,659 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2019-01-08 13:53:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:04,924 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-08 13:53:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-08 13:53:04,925 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-01-08 13:53:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:04,925 INFO L225 Difference]: With dead ends: 99 [2019-01-08 13:53:04,925 INFO L226 Difference]: Without dead ends: 98 [2019-01-08 13:53:04,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 13:53:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-08 13:53:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-01-08 13:53:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 13:53:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-08 13:53:04,930 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-01-08 13:53:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:04,931 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-08 13:53:04,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-08 13:53:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-08 13:53:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-08 13:53:04,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:04,931 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-01-08 13:53:04,931 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2019-01-08 13:53:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:04,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:04,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:05,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:05,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:05,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:05,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:05,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:05,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:05,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:05,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:05,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:05,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:05,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:05,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:06,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:08,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:08,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-08 13:53:08,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:08,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-08 13:53:08,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-08 13:53:08,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:08,359 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2019-01-08 13:53:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:08,574 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-08 13:53:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 13:53:08,574 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-01-08 13:53:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:08,575 INFO L225 Difference]: With dead ends: 102 [2019-01-08 13:53:08,576 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 13:53:08,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 13:53:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-08 13:53:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-08 13:53:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-08 13:53:08,581 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-01-08 13:53:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:08,581 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-08 13:53:08,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-08 13:53:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-08 13:53:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-08 13:53:08,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:08,582 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-01-08 13:53:08,583 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2019-01-08 13:53:08,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:08,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:08,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:09,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:09,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:09,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:09,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:09,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:09,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:09,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:09,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:09,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-08 13:53:09,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:09,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:09,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:09,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:09,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:09,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:10,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:12,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:12,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-08 13:53:12,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:12,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-08 13:53:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-08 13:53:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 13:53:12,682 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2019-01-08 13:53:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:12,946 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-08 13:53:12,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 13:53:12,946 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-01-08 13:53:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:12,947 INFO L225 Difference]: With dead ends: 105 [2019-01-08 13:53:12,948 INFO L226 Difference]: Without dead ends: 104 [2019-01-08 13:53:12,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 13:53:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-08 13:53:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-08 13:53:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 13:53:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-08 13:53:12,953 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-01-08 13:53:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:12,953 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-08 13:53:12,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-08 13:53:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-08 13:53:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-08 13:53:12,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:12,954 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-01-08 13:53:12,955 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2019-01-08 13:53:12,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:12,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:12,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:13,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:13,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:13,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:13,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:13,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:13,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:13,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:13,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:13,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:13,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:13,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:13,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:13,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:15,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:17,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:17,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-08 13:53:17,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:17,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-08 13:53:17,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-08 13:53:17,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:17,009 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2019-01-08 13:53:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:17,346 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-08 13:53:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 13:53:17,346 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-01-08 13:53:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:17,348 INFO L225 Difference]: With dead ends: 108 [2019-01-08 13:53:17,348 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 13:53:17,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 13:53:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-08 13:53:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-08 13:53:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-08 13:53:17,356 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-01-08 13:53:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:17,356 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-08 13:53:17,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-08 13:53:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-08 13:53:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-08 13:53:17,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:17,357 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-01-08 13:53:17,357 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:17,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:17,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2019-01-08 13:53:17,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:17,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:17,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:18,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:18,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:18,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:18,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:18,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:18,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:18,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:18,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:18,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:18,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:18,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:18,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:18,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:19,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:21,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:21,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-08 13:53:21,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:21,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-08 13:53:21,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-08 13:53:21,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-08 13:53:21,475 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2019-01-08 13:53:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:21,679 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-08 13:53:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 13:53:21,679 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-01-08 13:53:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:21,680 INFO L225 Difference]: With dead ends: 111 [2019-01-08 13:53:21,680 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 13:53:21,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-08 13:53:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 13:53:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-01-08 13:53:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-08 13:53:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-08 13:53:21,686 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-01-08 13:53:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:21,686 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-08 13:53:21,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-08 13:53:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-08 13:53:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-08 13:53:21,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:21,687 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-01-08 13:53:21,688 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:21,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2019-01-08 13:53:21,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:21,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:21,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:22,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:22,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:22,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:22,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:22,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:22,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:22,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-08 13:53:22,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:22,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:22,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:22,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:22,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:22,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:23,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-08 13:53:26,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:26,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 13:53:26,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 13:53:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:26,164 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2019-01-08 13:53:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:26,596 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-08 13:53:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-08 13:53:26,596 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-01-08 13:53:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:26,598 INFO L225 Difference]: With dead ends: 114 [2019-01-08 13:53:26,598 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 13:53:26,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 13:53:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-01-08 13:53:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-08 13:53:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-08 13:53:26,603 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-01-08 13:53:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:26,604 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-08 13:53:26,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 13:53:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-08 13:53:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-08 13:53:26,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:26,605 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-01-08 13:53:26,605 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2019-01-08 13:53:26,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:26,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:26,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:27,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:27,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:27,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:27,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:27,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:27,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:27,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:27,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:27,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:27,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:27,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:27,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:27,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:27,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:29,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:31,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:31,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-08 13:53:31,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:31,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-08 13:53:31,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-08 13:53:31,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 13:53:31,581 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2019-01-08 13:53:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:31,824 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-08 13:53:31,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 13:53:31,825 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-01-08 13:53:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:31,826 INFO L225 Difference]: With dead ends: 117 [2019-01-08 13:53:31,826 INFO L226 Difference]: Without dead ends: 116 [2019-01-08 13:53:31,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 13:53:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-08 13:53:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-01-08 13:53:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-08 13:53:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-08 13:53:31,831 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-01-08 13:53:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:31,831 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-08 13:53:31,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-08 13:53:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-08 13:53:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-08 13:53:31,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:31,832 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-01-08 13:53:31,833 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:31,833 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2019-01-08 13:53:31,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:31,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:31,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:32,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:32,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:32,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:32,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:32,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:32,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:32,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:32,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:32,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:32,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:32,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:32,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:32,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:34,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:36,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-08 13:53:36,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:36,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-08 13:53:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-08 13:53:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:53:36,740 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2019-01-08 13:53:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:37,051 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-08 13:53:37,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 13:53:37,052 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-01-08 13:53:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:37,053 INFO L225 Difference]: With dead ends: 120 [2019-01-08 13:53:37,053 INFO L226 Difference]: Without dead ends: 119 [2019-01-08 13:53:37,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:53:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-08 13:53:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-08 13:53:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-08 13:53:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-01-08 13:53:37,058 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-01-08 13:53:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:37,058 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-01-08 13:53:37,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-08 13:53:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-01-08 13:53:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-08 13:53:37,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:37,059 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-01-08 13:53:37,059 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2019-01-08 13:53:37,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:37,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:37,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:37,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:37,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:38,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:38,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:38,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:38,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:38,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:38,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:38,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:38,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-08 13:53:38,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:38,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:38,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:38,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:38,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:38,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:39,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:42,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:42,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-08 13:53:42,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:42,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 13:53:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 13:53:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 13:53:42,547 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2019-01-08 13:53:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:42,875 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-01-08 13:53:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-08 13:53:42,875 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-01-08 13:53:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:42,876 INFO L225 Difference]: With dead ends: 123 [2019-01-08 13:53:42,877 INFO L226 Difference]: Without dead ends: 122 [2019-01-08 13:53:42,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 13:53:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-08 13:53:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-01-08 13:53:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-08 13:53:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-08 13:53:42,881 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-01-08 13:53:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:42,882 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-08 13:53:42,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 13:53:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-08 13:53:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-08 13:53:42,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:42,882 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-01-08 13:53:42,883 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:42,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2019-01-08 13:53:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:42,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:42,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:44,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:44,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:44,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:44,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:44,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:44,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:44,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:44,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:44,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:44,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:44,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:44,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:44,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:44,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:44,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:46,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:49,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:49,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-08 13:53:49,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:49,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-08 13:53:49,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-08 13:53:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:53:49,021 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2019-01-08 13:53:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:49,341 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-08 13:53:49,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-08 13:53:49,342 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-01-08 13:53:49,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:49,343 INFO L225 Difference]: With dead ends: 126 [2019-01-08 13:53:49,343 INFO L226 Difference]: Without dead ends: 125 [2019-01-08 13:53:49,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:53:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-08 13:53:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-01-08 13:53:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-08 13:53:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-01-08 13:53:49,348 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-01-08 13:53:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:49,349 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-01-08 13:53:49,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-08 13:53:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-01-08 13:53:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-08 13:53:49,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:49,349 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-01-08 13:53:49,350 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2019-01-08 13:53:49,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:49,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:49,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:49,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:51,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:51,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:51,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:51,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:51,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:51,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:51,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:51,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:51,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:51,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:51,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:51,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:51,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:52,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:55,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:55,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-08 13:53:55,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:55,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-08 13:53:55,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-08 13:53:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-08 13:53:55,597 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2019-01-08 13:53:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:56,063 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-01-08 13:53:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-08 13:53:56,064 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-01-08 13:53:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:56,065 INFO L225 Difference]: With dead ends: 129 [2019-01-08 13:53:56,065 INFO L226 Difference]: Without dead ends: 128 [2019-01-08 13:53:56,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-08 13:53:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-08 13:53:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-01-08 13:53:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-08 13:53:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-01-08 13:53:56,072 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-01-08 13:53:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:56,073 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-01-08 13:53:56,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-08 13:53:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-01-08 13:53:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-08 13:53:56,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:56,074 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-01-08 13:53:56,074 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2019-01-08 13:53:56,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:56,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:56,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:56,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:56,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:59,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:59,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:59,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:59,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:59,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:59,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:59,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:59,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:59,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-08 13:53:59,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:59,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:59,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:53:59,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:59,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:59,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:01,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:04,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:04,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-08 13:54:04,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:04,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 13:54:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 13:54:04,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:04,345 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2019-01-08 13:54:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:04,723 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-01-08 13:54:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 13:54:04,723 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-01-08 13:54:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:04,725 INFO L225 Difference]: With dead ends: 132 [2019-01-08 13:54:04,725 INFO L226 Difference]: Without dead ends: 131 [2019-01-08 13:54:04,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-08 13:54:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-01-08 13:54:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-08 13:54:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-01-08 13:54:04,731 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-01-08 13:54:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:04,731 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-01-08 13:54:04,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 13:54:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-01-08 13:54:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-08 13:54:04,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:04,732 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-01-08 13:54:04,733 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2019-01-08 13:54:04,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:04,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:04,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:07,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:07,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:07,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:07,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:07,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:07,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:07,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:07,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:07,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:07,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:07,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:54:07,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:07,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:07,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:08,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:11,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:11,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-08 13:54:11,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:11,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-08 13:54:11,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-08 13:54:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-08 13:54:11,749 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2019-01-08 13:54:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:12,330 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-08 13:54:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-08 13:54:12,330 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-01-08 13:54:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:12,332 INFO L225 Difference]: With dead ends: 135 [2019-01-08 13:54:12,332 INFO L226 Difference]: Without dead ends: 134 [2019-01-08 13:54:12,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-08 13:54:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-08 13:54:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-01-08 13:54:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-08 13:54:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-01-08 13:54:12,338 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-01-08 13:54:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:12,339 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-01-08 13:54:12,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-08 13:54:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-01-08 13:54:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-08 13:54:12,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:12,340 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-01-08 13:54:12,340 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:12,341 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2019-01-08 13:54:12,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:12,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:12,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:15,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:15,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:15,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:15,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:15,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:15,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:15,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:15,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:15,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:15,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:54:15,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:15,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:15,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:16,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:19,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:19,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-08 13:54:19,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:19,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-08 13:54:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-08 13:54:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:54:19,999 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2019-01-08 13:54:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:20,269 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-01-08 13:54:20,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-08 13:54:20,270 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-01-08 13:54:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:20,271 INFO L225 Difference]: With dead ends: 138 [2019-01-08 13:54:20,271 INFO L226 Difference]: Without dead ends: 137 [2019-01-08 13:54:20,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:54:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-08 13:54:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-08 13:54:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-08 13:54:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-08 13:54:20,277 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-01-08 13:54:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:20,278 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-08 13:54:20,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-08 13:54:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-08 13:54:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-08 13:54:20,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:20,279 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-01-08 13:54:20,279 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2019-01-08 13:54:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:20,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:22,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:22,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:22,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:22,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:22,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:22,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:22,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:22,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:22,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-08 13:54:22,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:22,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:22,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:54:22,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:22,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:22,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:24,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:27,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:27,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-08 13:54:27,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:27,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 13:54:27,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 13:54:27,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-08 13:54:27,532 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2019-01-08 13:54:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:27,810 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-01-08 13:54:27,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 13:54:27,813 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-01-08 13:54:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:27,814 INFO L225 Difference]: With dead ends: 141 [2019-01-08 13:54:27,814 INFO L226 Difference]: Without dead ends: 140 [2019-01-08 13:54:27,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-08 13:54:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-08 13:54:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-01-08 13:54:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-08 13:54:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-01-08 13:54:27,819 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-01-08 13:54:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:27,820 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-01-08 13:54:27,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 13:54:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-01-08 13:54:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-08 13:54:27,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:27,821 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-01-08 13:54:27,821 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2019-01-08 13:54:27,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:27,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:29,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:29,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:29,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:29,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:29,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:29,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:29,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:29,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:29,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:29,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:54:29,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:29,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:29,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:30,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-08 13:54:34,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:34,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-08 13:54:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-08 13:54:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:54:34,468 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2019-01-08 13:54:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:34,934 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-01-08 13:54:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 13:54:34,935 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2019-01-08 13:54:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:34,937 INFO L225 Difference]: With dead ends: 144 [2019-01-08 13:54:34,938 INFO L226 Difference]: Without dead ends: 143 [2019-01-08 13:54:34,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:54:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-08 13:54:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-01-08 13:54:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-08 13:54:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-01-08 13:54:34,944 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-01-08 13:54:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:34,944 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-01-08 13:54:34,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-08 13:54:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-01-08 13:54:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-08 13:54:34,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:34,945 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2019-01-08 13:54:34,945 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2019-01-08 13:54:34,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:34,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:34,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:37,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:37,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:37,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:37,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:37,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:37,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:37,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:37,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:37,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:54:37,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:37,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:37,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:39,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-08 13:54:43,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:43,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-08 13:54:43,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-08 13:54:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-08 13:54:43,231 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2019-01-08 13:54:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:43,592 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-01-08 13:54:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-08 13:54:43,593 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2019-01-08 13:54:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:43,594 INFO L225 Difference]: With dead ends: 147 [2019-01-08 13:54:43,594 INFO L226 Difference]: Without dead ends: 146 [2019-01-08 13:54:43,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-08 13:54:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-08 13:54:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-01-08 13:54:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-08 13:54:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-01-08 13:54:43,600 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-01-08 13:54:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:43,601 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-01-08 13:54:43,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-08 13:54:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-01-08 13:54:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-08 13:54:43,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:43,602 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2019-01-08 13:54:43,602 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2019-01-08 13:54:43,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:43,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:43,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:43,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:43,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:45,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:45,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:45,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:45,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:45,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:45,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:45,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:45,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:45,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-08 13:54:45,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:45,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:45,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:54:45,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:45,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:45,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:47,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:51,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:51,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-08 13:54:51,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:51,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-08 13:54:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-08 13:54:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:54:51,322 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2019-01-08 13:54:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:51,680 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-08 13:54:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 13:54:51,680 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2019-01-08 13:54:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:51,682 INFO L225 Difference]: With dead ends: 150 [2019-01-08 13:54:51,682 INFO L226 Difference]: Without dead ends: 149 [2019-01-08 13:54:51,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:54:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-08 13:54:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-01-08 13:54:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-08 13:54:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-01-08 13:54:51,689 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-01-08 13:54:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:51,689 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-01-08 13:54:51,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-08 13:54:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-01-08 13:54:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-08 13:54:51,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:51,690 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2019-01-08 13:54:51,690 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2019-01-08 13:54:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:51,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:51,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:53,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:53,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:53,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:53,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:53,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:53,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:53,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:53,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:53,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:53,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:53,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:53,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:54:53,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:53,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:53,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:55,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:59,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:59,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-08 13:54:59,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:59,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-08 13:54:59,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-08 13:54:59,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-08 13:54:59,325 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2019-01-08 13:54:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:59,812 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-01-08 13:54:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-08 13:54:59,813 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2019-01-08 13:54:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:59,814 INFO L225 Difference]: With dead ends: 153 [2019-01-08 13:54:59,814 INFO L226 Difference]: Without dead ends: 152 [2019-01-08 13:54:59,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-08 13:54:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-08 13:54:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-01-08 13:54:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-08 13:54:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-08 13:54:59,821 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-01-08 13:54:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:59,821 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-08 13:54:59,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-08 13:54:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-08 13:54:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-08 13:54:59,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:59,822 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2019-01-08 13:54:59,822 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2019-01-08 13:54:59,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:59,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:59,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:59,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:01,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:01,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:01,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:01,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:01,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:01,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:01,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:01,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:01,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:01,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:55:01,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:01,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:01,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:03,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:07,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:07,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-08 13:55:07,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:07,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-08 13:55:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-08 13:55:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:55:07,657 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2019-01-08 13:55:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:08,041 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-01-08 13:55:08,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 13:55:08,041 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2019-01-08 13:55:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:08,043 INFO L225 Difference]: With dead ends: 156 [2019-01-08 13:55:08,043 INFO L226 Difference]: Without dead ends: 155 [2019-01-08 13:55:08,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:55:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-08 13:55:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-01-08 13:55:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-08 13:55:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-01-08 13:55:08,049 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-01-08 13:55:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:08,050 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-01-08 13:55:08,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-08 13:55:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-01-08 13:55:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-08 13:55:08,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:08,051 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2019-01-08 13:55:08,051 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:08,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2019-01-08 13:55:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:08,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:08,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:09,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:09,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:09,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:09,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:09,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:09,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:09,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-08 13:55:09,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:09,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:09,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:55:09,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:10,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:10,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:11,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:16,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:16,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-08 13:55:16,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:16,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-08 13:55:16,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-08 13:55:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-08 13:55:16,100 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2019-01-08 13:55:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:16,429 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-01-08 13:55:16,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-08 13:55:16,430 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2019-01-08 13:55:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:16,431 INFO L225 Difference]: With dead ends: 159 [2019-01-08 13:55:16,432 INFO L226 Difference]: Without dead ends: 158 [2019-01-08 13:55:16,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-08 13:55:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-08 13:55:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-01-08 13:55:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-08 13:55:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-08 13:55:16,437 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-01-08 13:55:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:16,437 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-08 13:55:16,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-08 13:55:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-08 13:55:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-08 13:55:16,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:16,438 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2019-01-08 13:55:16,439 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2019-01-08 13:55:16,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:16,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:16,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:16,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:18,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:18,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:18,792 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:18,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:18,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:18,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:18,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:18,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:18,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:18,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:18,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:18,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:55:18,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:18,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:18,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:21,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:26,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:26,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-01-08 13:55:26,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:26,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-08 13:55:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-08 13:55:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:55:26,188 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2019-01-08 13:55:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:26,576 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-01-08 13:55:26,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 13:55:26,577 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2019-01-08 13:55:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:26,578 INFO L225 Difference]: With dead ends: 162 [2019-01-08 13:55:26,578 INFO L226 Difference]: Without dead ends: 161 [2019-01-08 13:55:26,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:55:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-08 13:55:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-01-08 13:55:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-08 13:55:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-01-08 13:55:26,585 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-01-08 13:55:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:26,586 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-01-08 13:55:26,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-08 13:55:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-01-08 13:55:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-08 13:55:26,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:26,587 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2019-01-08 13:55:26,587 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2019-01-08 13:55:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:26,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:26,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:28,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:28,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:28,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:28,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:28,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:28,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:28,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:28,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:28,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:55:28,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:28,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:28,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:30,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:35,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:35,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-01-08 13:55:35,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:35,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-08 13:55:35,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-08 13:55:35,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-08 13:55:35,284 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2019-01-08 13:55:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:35,738 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-08 13:55:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 13:55:35,739 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2019-01-08 13:55:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:35,740 INFO L225 Difference]: With dead ends: 165 [2019-01-08 13:55:35,740 INFO L226 Difference]: Without dead ends: 164 [2019-01-08 13:55:35,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-08 13:55:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-08 13:55:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-01-08 13:55:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-08 13:55:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-01-08 13:55:35,746 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-01-08 13:55:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:35,746 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-01-08 13:55:35,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-08 13:55:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-01-08 13:55:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-08 13:55:35,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:35,747 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2019-01-08 13:55:35,748 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2019-01-08 13:55:35,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:35,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:35,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:37,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:37,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:37,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:37,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:37,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:37,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:37,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:37,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:37,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-08 13:55:37,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:37,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:37,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:55:37,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:37,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:37,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:40,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:45,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:45,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-01-08 13:55:45,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:45,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-08 13:55:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-08 13:55:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:55:45,508 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2019-01-08 13:55:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:45,930 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-01-08 13:55:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-08 13:55:45,931 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2019-01-08 13:55:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:45,932 INFO L225 Difference]: With dead ends: 168 [2019-01-08 13:55:45,932 INFO L226 Difference]: Without dead ends: 167 [2019-01-08 13:55:45,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:55:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-08 13:55:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-01-08 13:55:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-08 13:55:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-08 13:55:45,938 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-01-08 13:55:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:45,938 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-08 13:55:45,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-08 13:55:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-08 13:55:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-08 13:55:45,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:45,939 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2019-01-08 13:55:45,939 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2019-01-08 13:55:45,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:45,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:45,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:45,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:45,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:47,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:47,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:47,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:47,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:47,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:47,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:47,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:47,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:47,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:47,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:47,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:47,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:55:47,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:47,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:47,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:50,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:54,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:54,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-01-08 13:55:54,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:54,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-08 13:55:54,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-08 13:55:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-08 13:55:54,816 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2019-01-08 13:55:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:55,206 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-08 13:55:55,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-08 13:55:55,207 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2019-01-08 13:55:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:55,208 INFO L225 Difference]: With dead ends: 171 [2019-01-08 13:55:55,208 INFO L226 Difference]: Without dead ends: 170 [2019-01-08 13:55:55,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-08 13:55:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-08 13:55:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-01-08 13:55:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-08 13:55:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-01-08 13:55:55,215 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-01-08 13:55:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:55,216 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-01-08 13:55:55,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-08 13:55:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-01-08 13:55:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-08 13:55:55,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:55,217 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2019-01-08 13:55:55,217 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2019-01-08 13:55:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:55,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:55,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:55,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:55,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:57,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:57,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:57,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:57,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:57,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:57,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:57,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:57,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:57,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:57,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:55:57,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:57,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:57,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:59,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:04,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:04,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-01-08 13:56:04,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:04,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-08 13:56:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-08 13:56:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:56:04,064 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2019-01-08 13:56:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:04,462 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-01-08 13:56:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 13:56:04,462 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2019-01-08 13:56:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:04,463 INFO L225 Difference]: With dead ends: 174 [2019-01-08 13:56:04,463 INFO L226 Difference]: Without dead ends: 173 [2019-01-08 13:56:04,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:56:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-08 13:56:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-01-08 13:56:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-08 13:56:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-01-08 13:56:04,468 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-01-08 13:56:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:04,469 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-01-08 13:56:04,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-08 13:56:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-01-08 13:56:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-08 13:56:04,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:04,470 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2019-01-08 13:56:04,470 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2019-01-08 13:56:04,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:04,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:06,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:06,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:06,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:06,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:06,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:06,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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:06,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:06,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:06,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-08 13:56:06,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:06,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:06,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:56:06,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:06,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:06,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:09,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:13,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:13,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-01-08 13:56:13,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:13,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-08 13:56:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-08 13:56:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-08 13:56:13,612 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2019-01-08 13:56:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:14,019 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-01-08 13:56:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 13:56:14,020 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2019-01-08 13:56:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:14,021 INFO L225 Difference]: With dead ends: 177 [2019-01-08 13:56:14,021 INFO L226 Difference]: Without dead ends: 176 [2019-01-08 13:56:14,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-08 13:56:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-08 13:56:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-01-08 13:56:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-08 13:56:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-01-08 13:56:14,026 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-01-08 13:56:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:14,026 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-01-08 13:56:14,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-08 13:56:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-01-08 13:56:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-08 13:56:14,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:14,027 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2019-01-08 13:56:14,028 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:14,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:14,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2019-01-08 13:56:14,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:14,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:14,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:14,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:14,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:16,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:16,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:16,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:16,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:16,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:16,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:16,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:16,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:16,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:16,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:16,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:16,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:56:16,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:16,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:16,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:18,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:23,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:23,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-01-08 13:56:23,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:23,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-08 13:56:23,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-08 13:56:23,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:56:23,589 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2019-01-08 13:56:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:24,050 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-08 13:56:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 13:56:24,050 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2019-01-08 13:56:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:24,052 INFO L225 Difference]: With dead ends: 180 [2019-01-08 13:56:24,052 INFO L226 Difference]: Without dead ends: 179 [2019-01-08 13:56:24,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:56:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-08 13:56:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-01-08 13:56:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-08 13:56:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-01-08 13:56:24,058 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-01-08 13:56:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:24,059 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-01-08 13:56:24,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-08 13:56:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-01-08 13:56:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-08 13:56:24,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:24,060 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2019-01-08 13:56:24,060 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2019-01-08 13:56:24,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:24,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:24,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:26,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:26,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:26,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:26,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:26,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:26,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:26,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:26,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:26,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:26,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:56:26,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:26,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:26,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:29,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:33,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:33,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-01-08 13:56:33,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:33,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-08 13:56:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-08 13:56:33,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-08 13:56:33,785 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2019-01-08 13:56:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:34,216 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-01-08 13:56:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-08 13:56:34,216 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2019-01-08 13:56:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:34,217 INFO L225 Difference]: With dead ends: 183 [2019-01-08 13:56:34,217 INFO L226 Difference]: Without dead ends: 182 [2019-01-08 13:56:34,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-08 13:56:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-08 13:56:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-01-08 13:56:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-08 13:56:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-08 13:56:34,224 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-01-08 13:56:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:34,224 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-08 13:56:34,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-08 13:56:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-08 13:56:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-08 13:56:34,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:34,225 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2019-01-08 13:56:34,225 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2019-01-08 13:56:34,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:34,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:34,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:34,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:34,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:36,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:36,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:36,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:36,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:36,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:36,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:36,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:36,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:37,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-08 13:56:37,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:37,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:37,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:56:37,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:37,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:37,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:40,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:45,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:45,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-01-08 13:56:45,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:45,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-08 13:56:45,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-08 13:56:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:56:45,005 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2019-01-08 13:56:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:45,442 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-01-08 13:56:45,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 13:56:45,443 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2019-01-08 13:56:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:45,444 INFO L225 Difference]: With dead ends: 186 [2019-01-08 13:56:45,445 INFO L226 Difference]: Without dead ends: 185 [2019-01-08 13:56:45,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:56:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-08 13:56:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-01-08 13:56:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-08 13:56:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-01-08 13:56:45,451 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-01-08 13:56:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:45,451 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-01-08 13:56:45,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-08 13:56:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-01-08 13:56:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-08 13:56:45,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:45,452 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2019-01-08 13:56:45,452 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2019-01-08 13:56:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:45,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:45,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:47,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:47,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:47,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:47,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:47,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:47,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:47,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:47,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:47,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:47,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:47,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:47,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:56:47,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:47,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:47,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:50,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:55,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:55,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-01-08 13:56:55,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:55,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-08 13:56:55,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-08 13:56:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-08 13:56:55,238 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2019-01-08 13:56:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:55,722 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-01-08 13:56:55,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 13:56:55,723 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2019-01-08 13:56:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:55,724 INFO L225 Difference]: With dead ends: 189 [2019-01-08 13:56:55,724 INFO L226 Difference]: Without dead ends: 188 [2019-01-08 13:56:55,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-08 13:56:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-08 13:56:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-01-08 13:56:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-08 13:56:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-01-08 13:56:55,729 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-01-08 13:56:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:55,729 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-01-08 13:56:55,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-08 13:56:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-01-08 13:56:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-08 13:56:55,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:55,730 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2019-01-08 13:56:55,730 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:55,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:55,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2019-01-08 13:56:55,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:55,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:55,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:55,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:55,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:58,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:58,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:58,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:58,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:58,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56: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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:58,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:58,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:58,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:56:58,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:58,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:58,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:01,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:05,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-01-08 13:57:05,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:05,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-08 13:57:05,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-08 13:57:05,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:05,826 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2019-01-08 13:57:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:06,312 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-01-08 13:57:06,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 13:57:06,312 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2019-01-08 13:57:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:06,314 INFO L225 Difference]: With dead ends: 192 [2019-01-08 13:57:06,314 INFO L226 Difference]: Without dead ends: 191 [2019-01-08 13:57:06,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-08 13:57:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-01-08 13:57:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-01-08 13:57:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-01-08 13:57:06,319 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-01-08 13:57:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:06,319 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-01-08 13:57:06,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-08 13:57:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-01-08 13:57:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-08 13:57:06,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:06,320 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2019-01-08 13:57:06,320 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2019-01-08 13:57:06,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:06,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:06,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:08,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:08,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:08,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:08,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:08,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:08,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:08,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:08,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:09,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-08 13:57:09,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:09,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:09,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:57:09,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:09,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:09,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:12,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:17,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:17,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-01-08 13:57:17,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:17,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-08 13:57:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-08 13:57:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-08 13:57:17,039 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2019-01-08 13:57:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:17,547 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-08 13:57:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-08 13:57:17,547 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2019-01-08 13:57:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:17,549 INFO L225 Difference]: With dead ends: 195 [2019-01-08 13:57:17,549 INFO L226 Difference]: Without dead ends: 194 [2019-01-08 13:57:17,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-08 13:57:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-08 13:57:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-01-08 13:57:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-08 13:57:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-01-08 13:57:17,554 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-01-08 13:57:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:17,554 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-01-08 13:57:17,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-08 13:57:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-01-08 13:57:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-08 13:57:17,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:17,555 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2019-01-08 13:57:17,556 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2019-01-08 13:57:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:17,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:17,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:20,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:20,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:20,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:20,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:20,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:20,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:20,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:20,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:20,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:20,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:20,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:57:20,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:20,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:20,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:23,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:28,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:28,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-01-08 13:57:28,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:28,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-08 13:57:28,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-08 13:57:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:57:28,306 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2019-01-08 13:57:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:28,858 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-01-08 13:57:28,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-08 13:57:28,858 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2019-01-08 13:57:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:28,860 INFO L225 Difference]: With dead ends: 198 [2019-01-08 13:57:28,860 INFO L226 Difference]: Without dead ends: 197 [2019-01-08 13:57:28,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:57:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-08 13:57:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-01-08 13:57:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-08 13:57:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-08 13:57:28,867 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-01-08 13:57:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:28,867 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-08 13:57:28,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-08 13:57:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-08 13:57:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-08 13:57:28,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:28,869 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2019-01-08 13:57:28,869 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2019-01-08 13:57:28,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:28,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:28,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:28,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:28,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:31,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:31,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:31,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:31,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:31,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:31,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:31,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:31,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:31,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:57:31,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:31,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:31,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:34,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:39,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:39,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-01-08 13:57:39,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:39,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-08 13:57:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-08 13:57:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-08 13:57:39,869 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-01-08 13:57:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:40,326 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-01-08 13:57:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 13:57:40,326 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-01-08 13:57:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:40,327 INFO L225 Difference]: With dead ends: 201 [2019-01-08 13:57:40,328 INFO L226 Difference]: Without dead ends: 200 [2019-01-08 13:57:40,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-08 13:57:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-08 13:57:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-01-08 13:57:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-08 13:57:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-01-08 13:57:40,334 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-01-08 13:57:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:40,335 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-01-08 13:57:40,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-08 13:57:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-01-08 13:57:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-08 13:57:40,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:40,336 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2019-01-08 13:57:40,336 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2019-01-08 13:57:40,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:40,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:43,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:43,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:43,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:43,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:43,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:43,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:43,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:43,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-08 13:57:43,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:43,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:43,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:57:43,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:43,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:43,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:47,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:52,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:52,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-01-08 13:57:52,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:52,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-08 13:57:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-08 13:57:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:57:52,148 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2019-01-08 13:57:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:52,614 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-01-08 13:57:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 13:57:52,615 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2019-01-08 13:57:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:52,615 INFO L225 Difference]: With dead ends: 204 [2019-01-08 13:57:52,615 INFO L226 Difference]: Without dead ends: 203 [2019-01-08 13:57:52,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:57:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-08 13:57:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-08 13:57:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-08 13:57:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-01-08 13:57:52,620 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-01-08 13:57:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:52,621 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-01-08 13:57:52,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-08 13:57:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-01-08 13:57:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-08 13:57:52,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:52,622 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2019-01-08 13:57:52,622 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2019-01-08 13:57:52,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:52,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:52,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:55,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:55,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:55,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:55,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:55,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:55,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:55,315 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:55,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:55,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:55,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:55,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:55,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:57:55,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:55,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:55,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:58,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:03,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:03,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-01-08 13:58:03,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:03,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-08 13:58:03,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-08 13:58:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-08 13:58:03,856 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2019-01-08 13:58:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:04,381 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-01-08 13:58:04,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-08 13:58:04,381 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2019-01-08 13:58:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:04,382 INFO L225 Difference]: With dead ends: 207 [2019-01-08 13:58:04,383 INFO L226 Difference]: Without dead ends: 206 [2019-01-08 13:58:04,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-08 13:58:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-08 13:58:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-01-08 13:58:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-08 13:58:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-01-08 13:58:04,388 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-01-08 13:58:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:04,388 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-01-08 13:58:04,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-08 13:58:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-01-08 13:58:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-08 13:58:04,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:04,389 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2019-01-08 13:58:04,390 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:04,390 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2019-01-08 13:58:04,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:04,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:04,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:04,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:04,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:07,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:07,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:07,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:07,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:07,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:07,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:07,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:07,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:07,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:58:07,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:07,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:07,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:10,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-01-08 13:58:15,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:15,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-08 13:58:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-08 13:58:15,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:58:15,999 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2019-01-08 13:58:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:16,434 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-08 13:58:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-08 13:58:16,435 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2019-01-08 13:58:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:16,435 INFO L225 Difference]: With dead ends: 210 [2019-01-08 13:58:16,435 INFO L226 Difference]: Without dead ends: 209 [2019-01-08 13:58:16,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:58:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-08 13:58:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-01-08 13:58:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-08 13:58:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-01-08 13:58:16,440 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-01-08 13:58:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:16,440 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-01-08 13:58:16,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-08 13:58:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-01-08 13:58:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-01-08 13:58:16,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:16,441 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2019-01-08 13:58:16,442 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2019-01-08 13:58:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:16,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:19,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:19,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:19,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:19,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:19,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:19,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:19,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:19,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:19,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-08 13:58:19,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:19,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:19,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:58:19,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:19,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:19,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:23,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:28,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:28,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-01-08 13:58:28,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:28,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-08 13:58:28,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-08 13:58:28,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-08 13:58:28,842 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2019-01-08 13:58:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:29,442 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-01-08 13:58:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-08 13:58:29,442 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2019-01-08 13:58:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:29,444 INFO L225 Difference]: With dead ends: 213 [2019-01-08 13:58:29,444 INFO L226 Difference]: Without dead ends: 212 [2019-01-08 13:58:29,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-08 13:58:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-08 13:58:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-01-08 13:58:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-08 13:58:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-08 13:58:29,450 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-01-08 13:58:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:29,450 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-08 13:58:29,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-08 13:58:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-08 13:58:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-08 13:58:29,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:29,451 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2019-01-08 13:58:29,451 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2019-01-08 13:58:29,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:32,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:32,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:32,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:32,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:32,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:32,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:32,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:32,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:32,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:32,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:32,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:32,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:58:32,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:32,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:32,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:35,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:41,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:41,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-01-08 13:58:41,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:41,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-08 13:58:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-08 13:58:41,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:58:41,068 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2019-01-08 13:58:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:41,570 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-01-08 13:58:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 13:58:41,571 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2019-01-08 13:58:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:41,572 INFO L225 Difference]: With dead ends: 216 [2019-01-08 13:58:41,572 INFO L226 Difference]: Without dead ends: 215 [2019-01-08 13:58:41,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:58:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-08 13:58:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-01-08 13:58:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-08 13:58:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-01-08 13:58:41,579 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-01-08 13:58:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:41,579 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-01-08 13:58:41,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-08 13:58:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-01-08 13:58:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-08 13:58:41,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:41,581 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2019-01-08 13:58:41,581 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2019-01-08 13:58:41,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:41,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:41,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:44,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:44,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:44,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:44,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:44,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:44,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:44,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:44,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:44,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:44,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:58:44,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:44,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:44,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:48,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:54,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:54,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-01-08 13:58:54,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:54,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-08 13:58:54,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-08 13:58:54,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-08 13:58:54,012 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2019-01-08 13:58:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:54,488 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-01-08 13:58:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-08 13:58:54,489 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2019-01-08 13:58:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:54,490 INFO L225 Difference]: With dead ends: 219 [2019-01-08 13:58:54,490 INFO L226 Difference]: Without dead ends: 218 [2019-01-08 13:58:54,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-08 13:58:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-08 13:58:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-01-08 13:58:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-08 13:58:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-08 13:58:54,496 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-01-08 13:58:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:54,496 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-08 13:58:54,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-08 13:58:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-08 13:58:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-08 13:58:54,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:54,498 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2019-01-08 13:58:54,498 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2019-01-08 13:58:54,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:54,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:54,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:57,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:57,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:57,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:57,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:57,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:57,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:57,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:57,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:57,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-08 13:58:57,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:57,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:57,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:58:57,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:58,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:58,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:01,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:06,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:06,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-01-08 13:59:06,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:06,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-08 13:59:06,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-08 13:59:06,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:59:06,953 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2019-01-08 13:59:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:07,467 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-01-08 13:59:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-08 13:59:07,467 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2019-01-08 13:59:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:07,469 INFO L225 Difference]: With dead ends: 222 [2019-01-08 13:59:07,469 INFO L226 Difference]: Without dead ends: 221 [2019-01-08 13:59:07,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:59:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-01-08 13:59:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-01-08 13:59:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-08 13:59:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-01-08 13:59:07,475 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-01-08 13:59:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-01-08 13:59:07,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-08 13:59:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-01-08 13:59:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-08 13:59:07,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:07,476 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2019-01-08 13:59:07,476 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2019-01-08 13:59:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:07,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:07,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:11,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:11,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:11,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:11,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:11,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:11,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:11,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:59:11,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:59:11,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:59:11,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:11,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:11,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:59:11,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:11,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:11,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:14,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:20,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:20,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-01-08 13:59:20,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:20,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-08 13:59:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-08 13:59:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-08 13:59:20,301 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2019-01-08 13:59:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:20,781 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-08 13:59:20,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 13:59:20,782 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2019-01-08 13:59:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:20,783 INFO L225 Difference]: With dead ends: 225 [2019-01-08 13:59:20,783 INFO L226 Difference]: Without dead ends: 224 [2019-01-08 13:59:20,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-08 13:59:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-08 13:59:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-01-08 13:59:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-01-08 13:59:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-01-08 13:59:20,789 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-01-08 13:59:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:20,789 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-01-08 13:59:20,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-08 13:59:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-01-08 13:59:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-01-08 13:59:20,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:20,790 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2019-01-08 13:59:20,791 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2019-01-08 13:59:20,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:20,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:24,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:24,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:24,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:24,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:24,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:24,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:24,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:24,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:24,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:24,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:59:24,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:24,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:24,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:28,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:33,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:33,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-01-08 13:59:33,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:33,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-08 13:59:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-08 13:59:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:59:33,766 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2019-01-08 13:59:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:34,376 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-01-08 13:59:34,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 13:59:34,376 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2019-01-08 13:59:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:34,377 INFO L225 Difference]: With dead ends: 228 [2019-01-08 13:59:34,378 INFO L226 Difference]: Without dead ends: 227 [2019-01-08 13:59:34,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:59:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-08 13:59:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-08 13:59:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-08 13:59:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-08 13:59:34,383 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-01-08 13:59:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:34,383 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-08 13:59:34,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-08 13:59:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-08 13:59:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-08 13:59:34,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:34,384 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2019-01-08 13:59:34,385 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2019-01-08 13:59:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:34,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:34,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:34,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:34,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:37,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:37,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:37,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:37,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:37,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:37,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:37,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:59:37,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:59:37,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-08 13:59:37,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:37,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:38,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:59:38,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:38,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:38,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:42,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:47,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-01-08 13:59:47,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:47,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-08 13:59:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-08 13:59:47,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-08 13:59:47,337 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2019-01-08 13:59:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:47,944 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-08 13:59:47,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-08 13:59:47,945 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2019-01-08 13:59:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:47,946 INFO L225 Difference]: With dead ends: 231 [2019-01-08 13:59:47,947 INFO L226 Difference]: Without dead ends: 230 [2019-01-08 13:59:47,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-08 13:59:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-08 13:59:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-01-08 13:59:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-08 13:59:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-01-08 13:59:47,954 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-01-08 13:59:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:47,955 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-01-08 13:59:47,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-08 13:59:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-01-08 13:59:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-08 13:59:47,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:47,956 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2019-01-08 13:59:47,956 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:47,956 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2019-01-08 13:59:47,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:51,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:51,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:51,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:51,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:51,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:51,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:59:51,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:59:51,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:59:51,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:51,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:51,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:59:51,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:51,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:51,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:56,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:02,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:02,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-01-08 14:00:02,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:02,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-08 14:00:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-08 14:00:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 14:00:02,219 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2019-01-08 14:00:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:02,862 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-01-08 14:00:02,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-08 14:00:02,862 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2019-01-08 14:00:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:02,863 INFO L225 Difference]: With dead ends: 234 [2019-01-08 14:00:02,864 INFO L226 Difference]: Without dead ends: 233 [2019-01-08 14:00:02,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 14:00:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-08 14:00:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-01-08 14:00:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-08 14:00:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-01-08 14:00:02,871 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-01-08 14:00:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:02,871 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-01-08 14:00:02,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-08 14:00:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-01-08 14:00:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-08 14:00:02,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:02,872 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2019-01-08 14:00:02,873 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2019-01-08 14:00:02,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:02,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:02,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:06,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:06,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:06,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:06,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:06,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:06,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:06,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:06,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:00:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:06,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:06,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:00:06,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:06,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:06,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:11,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:17,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:17,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-01-08 14:00:17,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:17,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-08 14:00:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-08 14:00:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-08 14:00:17,210 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2019-01-08 14:00:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:17,778 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-01-08 14:00:17,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-08 14:00:17,778 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2019-01-08 14:00:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:17,780 INFO L225 Difference]: With dead ends: 237 [2019-01-08 14:00:17,780 INFO L226 Difference]: Without dead ends: 236 [2019-01-08 14:00:17,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-08 14:00:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-08 14:00:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-01-08 14:00:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-08 14:00:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-01-08 14:00:17,786 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-01-08 14:00:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:17,786 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-01-08 14:00:17,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-08 14:00:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-01-08 14:00:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-01-08 14:00:17,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:17,787 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2019-01-08 14:00:17,787 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2019-01-08 14:00:17,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:17,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:17,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:17,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:17,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:21,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:21,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:21,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:21,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:21,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:21,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:21,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:21,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:21,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-08 14:00:21,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:21,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:21,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:00:21,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:22,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:22,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:26,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:32,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:32,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-01-08 14:00:32,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:32,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-08 14:00:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-08 14:00:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 14:00:32,417 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2019-01-08 14:00:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:33,089 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-08 14:00:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-08 14:00:33,089 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2019-01-08 14:00:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:33,090 INFO L225 Difference]: With dead ends: 240 [2019-01-08 14:00:33,090 INFO L226 Difference]: Without dead ends: 239 [2019-01-08 14:00:33,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 14:00:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-08 14:00:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-01-08 14:00:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-08 14:00:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-01-08 14:00:33,095 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-01-08 14:00:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:33,095 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-01-08 14:00:33,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-08 14:00:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-01-08 14:00:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-01-08 14:00:33,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:33,096 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2019-01-08 14:00:33,096 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2019-01-08 14:00:33,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:33,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:33,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:33,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:33,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:37,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:37,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:37,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:37,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:37,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:37,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:37,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:00:37,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:00:37,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:00:37,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:37,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:37,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:00:37,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:37,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:37,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:41,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:47,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:47,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-01-08 14:00:47,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:47,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-08 14:00:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-08 14:00:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-08 14:00:47,874 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2019-01-08 14:00:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:48,472 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-01-08 14:00:48,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-08 14:00:48,473 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2019-01-08 14:00:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:48,474 INFO L225 Difference]: With dead ends: 243 [2019-01-08 14:00:48,474 INFO L226 Difference]: Without dead ends: 242 [2019-01-08 14:00:48,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-08 14:00:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-08 14:00:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-01-08 14:00:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-08 14:00:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-08 14:00:48,482 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-01-08 14:00:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:48,482 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-08 14:00:48,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-08 14:00:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-08 14:00:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-08 14:00:48,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:48,483 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2019-01-08 14:00:48,484 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2019-01-08 14:00:48,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:48,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:48,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:48,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:52,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:52,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:52,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:52,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:52,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:52,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:52,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:52,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:00:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:52,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:52,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:00:52,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:52,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:52,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:57,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:03,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:03,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-01-08 14:01:03,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:03,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-08 14:01:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-08 14:01:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 14:01:03,555 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2019-01-08 14:01:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:04,158 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-01-08 14:01:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-08 14:01:04,159 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2019-01-08 14:01:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:04,160 INFO L225 Difference]: With dead ends: 246 [2019-01-08 14:01:04,160 INFO L226 Difference]: Without dead ends: 245 [2019-01-08 14:01:04,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 14:01:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-08 14:01:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-01-08 14:01:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-01-08 14:01:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-01-08 14:01:04,165 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-01-08 14:01:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:04,166 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-01-08 14:01:04,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-08 14:01:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-01-08 14:01:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-01-08 14:01:04,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:04,167 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2019-01-08 14:01:04,167 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2019-01-08 14:01:04,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:04,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:09,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:09,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:09,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:09,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:09,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:09,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:09,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:01:09,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:01:09,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-08 14:01:09,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:09,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:09,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:01:09,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:09,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:09,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:01:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:14,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:20,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:20,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-01-08 14:01:20,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:20,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-08 14:01:20,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-08 14:01:20,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-08 14:01:20,339 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2019-01-08 14:01:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:20,916 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-01-08 14:01:20,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 14:01:20,916 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2019-01-08 14:01:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:20,917 INFO L225 Difference]: With dead ends: 249 [2019-01-08 14:01:20,917 INFO L226 Difference]: Without dead ends: 248 [2019-01-08 14:01:20,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-08 14:01:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-08 14:01:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-01-08 14:01:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-08 14:01:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-01-08 14:01:20,923 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-01-08 14:01:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:20,923 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-01-08 14:01:20,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-08 14:01:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-01-08 14:01:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-08 14:01:20,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:20,924 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2019-01-08 14:01:20,924 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2019-01-08 14:01:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:20,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:20,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:25,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:25,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:25,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:25,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:25,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:25,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:25,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:25,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:25,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:25,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:25,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:25,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:01:25,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:25,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:25,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:01:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:30,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:36,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:36,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-01-08 14:01:36,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-08 14:01:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-08 14:01:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:01:36,556 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2019-01-08 14:01:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:37,277 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-01-08 14:01:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-08 14:01:37,278 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2019-01-08 14:01:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:37,279 INFO L225 Difference]: With dead ends: 252 [2019-01-08 14:01:37,279 INFO L226 Difference]: Without dead ends: 251 [2019-01-08 14:01:37,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:01:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-08 14:01:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-01-08 14:01:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-08 14:01:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-01-08 14:01:37,284 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-01-08 14:01:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:37,284 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-01-08 14:01:37,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-08 14:01:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-01-08 14:01:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-01-08 14:01:37,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:37,286 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2019-01-08 14:01:37,286 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:37,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:37,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2019-01-08 14:01:37,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:37,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:37,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:41,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:41,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:41,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:41,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:41,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:41,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:41,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:41,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:41,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:41,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:01:41,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:01:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:46,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:51,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:51,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-01-08 14:01:51,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:51,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-08 14:01:51,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-08 14:01:51,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-08 14:01:51,589 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2019-01-08 14:01:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:52,232 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-08 14:01:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-08 14:01:52,232 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2019-01-08 14:01:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:52,234 INFO L225 Difference]: With dead ends: 255 [2019-01-08 14:01:52,234 INFO L226 Difference]: Without dead ends: 254 [2019-01-08 14:01:52,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-08 14:01:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-08 14:01:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-01-08 14:01:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-08 14:01:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-01-08 14:01:52,239 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-01-08 14:01:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:52,239 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-01-08 14:01:52,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-08 14:01:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-01-08 14:01:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-08 14:01:52,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:52,241 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2019-01-08 14:01:52,241 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2019-01-08 14:01:52,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:52,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:52,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:56,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:56,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:56,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:56,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:56,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:56,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:01:56,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:01:56,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-08 14:01:56,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:56,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:56,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:01:56,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:56,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:56,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:02:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:02,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:07,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:07,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-01-08 14:02:07,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:07,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-08 14:02:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-08 14:02:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 14:02:07,952 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2019-01-08 14:02:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:08,594 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-01-08 14:02:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 14:02:08,594 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2019-01-08 14:02:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:08,596 INFO L225 Difference]: With dead ends: 258 [2019-01-08 14:02:08,596 INFO L226 Difference]: Without dead ends: 257 [2019-01-08 14:02:08,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 14:02:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-01-08 14:02:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-01-08 14:02:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-08 14:02:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-08 14:02:08,601 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-01-08 14:02:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:08,602 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-08 14:02:08,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-08 14:02:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-08 14:02:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-08 14:02:08,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:08,603 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2019-01-08 14:02:08,603 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2019-01-08 14:02:08,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:08,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:08,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:13,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:13,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:13,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:13,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:13,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:13,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:13,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:02:13,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:02:13,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:02:13,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:13,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:13,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:02:13,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:13,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:13,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:02:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:18,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:24,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:24,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-01-08 14:02:24,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:24,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-08 14:02:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-08 14:02:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-08 14:02:24,239 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2019-01-08 14:02:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:24,927 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-01-08 14:02:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-08 14:02:24,927 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2019-01-08 14:02:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:24,929 INFO L225 Difference]: With dead ends: 261 [2019-01-08 14:02:24,929 INFO L226 Difference]: Without dead ends: 260 [2019-01-08 14:02:24,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-08 14:02:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-08 14:02:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-01-08 14:02:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-08 14:02:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-01-08 14:02:24,935 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-01-08 14:02:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:24,936 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-01-08 14:02:24,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-08 14:02:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-01-08 14:02:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-08 14:02:24,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:24,937 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2019-01-08 14:02:24,937 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2019-01-08 14:02:24,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:24,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:24,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:24,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:24,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:29,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:29,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:29,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:29,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:29,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:29,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:29,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:29,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:29,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:29,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:02:29,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:29,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:29,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:02:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:35,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:40,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:40,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-01-08 14:02:40,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:40,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-08 14:02:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-08 14:02:40,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 14:02:40,902 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2019-01-08 14:02:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:41,596 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-01-08 14:02:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-08 14:02:41,596 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2019-01-08 14:02:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:41,597 INFO L225 Difference]: With dead ends: 264 [2019-01-08 14:02:41,597 INFO L226 Difference]: Without dead ends: 263 [2019-01-08 14:02:41,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 14:02:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-01-08 14:02:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-01-08 14:02:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-08 14:02:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-01-08 14:02:41,605 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-01-08 14:02:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:41,605 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-01-08 14:02:41,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-08 14:02:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-01-08 14:02:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-08 14:02:41,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:41,607 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2019-01-08 14:02:41,607 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2019-01-08 14:02:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:46,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:46,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:46,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:46,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:46,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:46,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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:46,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:02:46,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:02:46,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-08 14:02:46,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:46,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:46,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:02:46,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:46,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:46,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:02:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:52,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:58,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:58,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-01-08 14:02:58,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-08 14:02:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-08 14:02:58,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-08 14:02:58,087 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2019-01-08 14:02:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:58,847 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-01-08 14:02:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-08 14:02:58,848 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2019-01-08 14:02:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:58,849 INFO L225 Difference]: With dead ends: 267 [2019-01-08 14:02:58,849 INFO L226 Difference]: Without dead ends: 266 [2019-01-08 14:02:58,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-08 14:02:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-08 14:02:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-01-08 14:02:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-01-08 14:02:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-01-08 14:02:58,855 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-01-08 14:02:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:58,855 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-01-08 14:02:58,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-08 14:02:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-01-08 14:02:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-08 14:02:58,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:58,857 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2019-01-08 14:02:58,857 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2019-01-08 14:02:58,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:58,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:58,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:58,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:58,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:03,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:03,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:03,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:03,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:03,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:03,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:03:03,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:03:03,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:03:03,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:03,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:03,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:03:03,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:03:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:09,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:14,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:14,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-01-08 14:03:14,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:14,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-01-08 14:03:14,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-01-08 14:03:14,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 14:03:14,710 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2019-01-08 14:03:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:15,366 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-08 14:03:15,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-08 14:03:15,367 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2019-01-08 14:03:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:15,368 INFO L225 Difference]: With dead ends: 270 [2019-01-08 14:03:15,368 INFO L226 Difference]: Without dead ends: 269 [2019-01-08 14:03:15,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 14:03:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-08 14:03:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-01-08 14:03:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-01-08 14:03:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-01-08 14:03:15,373 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-01-08 14:03:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:15,374 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-01-08 14:03:15,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-01-08 14:03:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-01-08 14:03:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-01-08 14:03:15,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:15,375 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2019-01-08 14:03:15,375 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2019-01-08 14:03:15,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:15,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:15,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:20,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:20,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:20,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:20,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:20,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:20,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:20,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:20,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:20,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:20,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:03:20,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:03:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:26,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:32,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:32,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-01-08 14:03:32,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:32,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-01-08 14:03:32,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-01-08 14:03:32,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-08 14:03:32,079 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2019-01-08 14:03:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:32,867 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-01-08 14:03:32,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-08 14:03:32,867 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2019-01-08 14:03:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:32,869 INFO L225 Difference]: With dead ends: 273 [2019-01-08 14:03:32,869 INFO L226 Difference]: Without dead ends: 272 [2019-01-08 14:03:32,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-08 14:03:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-08 14:03:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-01-08 14:03:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-08 14:03:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-08 14:03:32,875 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-01-08 14:03:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:32,876 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-08 14:03:32,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-01-08 14:03:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-08 14:03:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-08 14:03:32,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:32,877 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2019-01-08 14:03:32,877 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2019-01-08 14:03:32,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:32,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:32,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:37,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:37,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:37,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:37,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:37,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:37,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:37,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:37,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:38,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-01-08 14:03:38,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:38,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:38,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:03:38,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:38,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:38,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:03:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:43,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:49,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-01-08 14:03:49,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:49,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-01-08 14:03:49,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-01-08 14:03:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:03:49,666 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2019-01-08 14:03:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:50,516 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-01-08 14:03:50,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-08 14:03:50,516 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2019-01-08 14:03:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:50,518 INFO L225 Difference]: With dead ends: 276 [2019-01-08 14:03:50,518 INFO L226 Difference]: Without dead ends: 275 [2019-01-08 14:03:50,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:03:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-08 14:03:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-01-08 14:03:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-08 14:03:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-01-08 14:03:50,524 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-01-08 14:03:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:50,524 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-01-08 14:03:50,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-01-08 14:03:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-01-08 14:03:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-01-08 14:03:50,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:50,525 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2019-01-08 14:03:50,526 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2019-01-08 14:03:50,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:50,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:50,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:55,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:55,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:55,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:55,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:55,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:55,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:55,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:03:55,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:03:55,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:03:55,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:55,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:55,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:03:55,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:55,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:55,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:04:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:01,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:07,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:07,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-01-08 14:04:07,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:07,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-01-08 14:04:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-01-08 14:04:07,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-08 14:04:07,658 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2019-01-08 14:04:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:08,401 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-01-08 14:04:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-08 14:04:08,401 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2019-01-08 14:04:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:08,403 INFO L225 Difference]: With dead ends: 279 [2019-01-08 14:04:08,403 INFO L226 Difference]: Without dead ends: 278 [2019-01-08 14:04:08,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-08 14:04:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-08 14:04:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-01-08 14:04:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-08 14:04:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-08 14:04:08,408 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-01-08 14:04:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:08,409 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-08 14:04:08,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-01-08 14:04:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-08 14:04:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-08 14:04:08,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:08,410 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2019-01-08 14:04:08,410 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2019-01-08 14:04:08,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:08,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:08,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:13,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:13,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:13,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:13,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:13,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:13,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:13,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:13,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:13,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:13,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:04:13,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:04:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:19,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:25,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:25,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-01-08 14:04:25,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:25,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-01-08 14:04:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-01-08 14:04:25,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:04:25,791 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2019-01-08 14:04:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:26,532 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-01-08 14:04:26,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-08 14:04:26,533 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2019-01-08 14:04:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:26,535 INFO L225 Difference]: With dead ends: 282 [2019-01-08 14:04:26,535 INFO L226 Difference]: Without dead ends: 281 [2019-01-08 14:04:26,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:04:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-08 14:04:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-01-08 14:04:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-08 14:04:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-01-08 14:04:26,541 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-01-08 14:04:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:26,541 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-01-08 14:04:26,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-01-08 14:04:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-01-08 14:04:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-01-08 14:04:26,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:26,543 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2019-01-08 14:04:26,543 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2019-01-08 14:04:26,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:26,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:26,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:31,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:31,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:31,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:31,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:31,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:31,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:32,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-01-08 14:04:32,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:32,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:32,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:04:32,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:04:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:38,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:44,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:44,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-01-08 14:04:44,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:44,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-01-08 14:04:44,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-01-08 14:04:44,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-08 14:04:44,186 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2019-01-08 14:04:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:44,979 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-08 14:04:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-08 14:04:44,980 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2019-01-08 14:04:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:44,981 INFO L225 Difference]: With dead ends: 285 [2019-01-08 14:04:44,981 INFO L226 Difference]: Without dead ends: 284 [2019-01-08 14:04:44,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-08 14:04:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-08 14:04:44,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-01-08 14:04:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-08 14:04:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-01-08 14:04:44,988 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-01-08 14:04:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:44,988 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-01-08 14:04:44,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-01-08 14:04:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-01-08 14:04:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-01-08 14:04:44,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:44,989 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2019-01-08 14:04:44,989 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2019-01-08 14:04:44,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:44,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:44,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:50,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:50,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:50,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:50,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:50,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:50,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:50,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:04:50,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:04:50,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:04:50,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:50,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:50,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:04:50,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9