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/20170304-DifficultPathPrograms/diamond1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:26:35,836 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:26:35,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:26:35,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:26:35,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:26:35,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:26:35,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:26:35,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:26:35,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:26:35,858 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:26:35,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:26:35,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:26:35,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:26:35,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:26:35,863 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:26:35,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:26:35,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:26:35,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:26:35,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:26:35,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:26:35,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:26:35,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:26:35,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:26:35,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:26:35,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:26:35,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:26:35,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:26:35,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:26:35,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:26:35,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:26:35,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:26:35,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:26:35,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:26:35,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:26:35,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:26:35,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:26:35,886 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 [2018-12-03 15:26:35,899 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:26:35,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:26:35,900 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:26:35,900 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:26:35,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:26:35,901 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:26:35,901 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:26:35,902 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:26:35,902 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:26:35,902 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:26:35,902 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:26:35,903 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:26:35,903 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:26:35,903 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:26:35,903 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:26:35,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:26:35,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:26:35,905 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:26:35,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:26:35,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:26:35,906 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:26:35,906 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:26:35,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:26:35,906 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:26:35,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:26:35,907 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:26:35,907 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:26:35,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:26:35,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:26:35,908 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:26:35,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:26:35,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:26:35,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:26:35,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:26:35,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:26:35,909 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:26:35,910 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:26:35,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:26:35,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:26:35,910 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:26:35,910 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:26:35,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:26:35,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:26:35,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:26:35,969 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:26:35,969 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:26:35,970 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl [2018-12-03 15:26:35,970 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl' [2018-12-03 15:26:36,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:26:36,028 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:26:36,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:26:36,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:26:36,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:26:36,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:26:36,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:26:36,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:26:36,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:26:36,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... [2018-12-03 15:26:36,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:26:36,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:26:36,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:26:36,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:26:36,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:26:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:26:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:26:36,446 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:26:36,446 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:26:36,447 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:26:36 BoogieIcfgContainer [2018-12-03 15:26:36,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:26:36,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:26:36,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:26:36,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:26:36,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:26:36" (1/2) ... [2018-12-03 15:26:36,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@853ce48 and model type diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:26:36, skipping insertion in model container [2018-12-03 15:26:36,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:26:36" (2/2) ... [2018-12-03 15:26:36,456 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond1.i_3.bpl [2018-12-03 15:26:36,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:26:36,478 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:26:36,496 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:26:36,527 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:26:36,528 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:26:36,528 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:26:36,528 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:26:36,528 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:26:36,528 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:26:36,529 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:26:36,529 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:26:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:26:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:26:36,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:36,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:26:36,554 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:36,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:26:36,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:36,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:36,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:36,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:36,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:36,897 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 15:26:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:36,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:26:36,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:26:36,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:26:36,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:26:36,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:26:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:26:36,926 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:26:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:36,974 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:26:36,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:26:36,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:26:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:36,987 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:26:36,988 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:26:36,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:26:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:26:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:26:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:26:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:26:37,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:26:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:37,026 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:26:37,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:26:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:26:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:26:37,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:37,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:26:37,027 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:37,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:37,028 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:26:37,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:37,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:37,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:37,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:37,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:37,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:37,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:37,185 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:26:37,187 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:26:37,228 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:26:37,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:26:37,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:26:37,576 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:26:37,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:37,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:26:37,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:37,602 INFO L192 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 [2018-12-03 15:26:37,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:37,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:37,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:37,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:37,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:37,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 15:26:37,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:37,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:26:37,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:26:37,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:26:37,794 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 15:26:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:37,860 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:26:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:26:37,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 15:26:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:37,862 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:26:37,862 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:26:37,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:26:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:26:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:26:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:26:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:26:37,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:26:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:37,867 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:26:37,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:26:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:26:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:26:37,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:37,868 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:26:37,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:37,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 15:26:37,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:37,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:38,141 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:26:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:38,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:38,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:38,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:38,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:38,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:38,144 INFO L192 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 [2018-12-03 15:26:38,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:38,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:38,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:26:38,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:38,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:38,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:38,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:38,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 15:26:38,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:38,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:26:38,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:26:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:26:38,537 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 15:26:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:38,579 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:26:38,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:26:38,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:26:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:38,582 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:26:38,582 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:26:38,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:26:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:26:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:26:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:26:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:26:38,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:26:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:38,586 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:26:38,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:26:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:26:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:26:38,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:38,587 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:26:38,588 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:38,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 15:26:38,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:38,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:38,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:38,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:38,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:38,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:38,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:38,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:38,889 INFO L192 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 [2018-12-03 15:26:38,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:38,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:38,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:38,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:38,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:38,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 15:26:39,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:39,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:26:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:26:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:26:39,118 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 15:26:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:39,153 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:26:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:26:39,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 15:26:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:39,155 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:26:39,155 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:26:39,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:26:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:26:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:26:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:26:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:26:39,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:26:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:39,160 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:26:39,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:26:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:26:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:26:39,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:39,161 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:26:39,161 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:39,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 15:26:39,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:39,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:39,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:39,635 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:26:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:39,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:39,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:39,636 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:39,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:39,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:39,637 INFO L192 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 [2018-12-03 15:26:39,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:39,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:39,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:39,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:40,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:40,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 15:26:40,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:40,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:26:40,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:26:40,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:26:40,128 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 15:26:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:40,209 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:26:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:26:40,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 15:26:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:40,212 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:26:40,213 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:26:40,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:26:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:26:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:26:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:26:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:26:40,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:26:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:40,218 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:26:40,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:26:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:26:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:26:40,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:40,219 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:26:40,219 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:40,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 15:26:40,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:40,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:40,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:40,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:40,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:40,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:40,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:40,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:40,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:40,573 INFO L192 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 [2018-12-03 15:26:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:40,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:40,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:26:40,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:40,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:40,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:41,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:41,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 15:26:41,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:41,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:26:41,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:26:41,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:26:41,068 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 15:26:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:41,151 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:26:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:26:41,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 15:26:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:41,152 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:26:41,153 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:26:41,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:26:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:26:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:26:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:26:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:26:41,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:26:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:41,158 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:26:41,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:26:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:26:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:26:41,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:41,159 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:26:41,159 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:41,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 15:26:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:41,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:41,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:41,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:41,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:41,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:41,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:41,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:41,459 INFO L192 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 [2018-12-03 15:26:41,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:41,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:41,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:41,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:41,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:41,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:42,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:26:42,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:42,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:26:42,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:26:42,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:26:42,074 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 15:26:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:42,172 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:26:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:26:42,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 15:26:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:42,174 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:26:42,174 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:26:42,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:26:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:26:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:26:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:26:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:26:42,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:26:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:42,179 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:26:42,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:26:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:26:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:26:42,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:42,179 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:26:42,180 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:42,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 15:26:42,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:42,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:42,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:42,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:42,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:42,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:42,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:42,446 INFO L192 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 [2018-12-03 15:26:42,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:42,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:42,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:42,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:43,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:43,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 15:26:43,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:43,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:26:43,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:26:43,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:26:43,003 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 15:26:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:43,120 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:26:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:26:43,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 15:26:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:43,123 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:26:43,123 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:26:43,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:26:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:26:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:26:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:26:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:26:43,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:26:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:43,127 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:26:43,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:26:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:26:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:26:43,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:43,127 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:26:43,127 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:43,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 15:26:43,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:43,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:43,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:43,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:43,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:43,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:43,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:43,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:43,326 INFO L192 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 [2018-12-03 15:26:43,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:43,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:43,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:26:43,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:43,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:43,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:44,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 15:26:44,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:44,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:26:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:26:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:26:44,481 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 15:26:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:44,595 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:26:44,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:26:44,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 15:26:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:44,597 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:26:44,597 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:26:44,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:26:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:26:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:26:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:26:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:26:44,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:26:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:44,602 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:26:44,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:26:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:26:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:26:44,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:44,603 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:26:44,603 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:44,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 15:26:44,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:44,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:44,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:44,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:44,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:44,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:44,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:44,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:44,959 INFO L192 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 [2018-12-03 15:26:44,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:44,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:44,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:44,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:44,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:45,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:46,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:26:46,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:46,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:26:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:26:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:26:46,296 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 15:26:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:46,481 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:26:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:26:46,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 15:26:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:46,482 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:26:46,482 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:26:46,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:26:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:26:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:26:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:26:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:26:46,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 15:26:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:46,487 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:26:46,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:26:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:26:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:26:46,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:46,488 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 15:26:46,488 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:46,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 15:26:46,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:46,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:46,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:47,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:47,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:47,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:47,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:47,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:47,016 INFO L192 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 [2018-12-03 15:26:47,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:47,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:47,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:47,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:48,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:48,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 15:26:48,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:48,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:26:48,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:26:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:26:48,283 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 15:26:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:48,425 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:26:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:26:48,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 15:26:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:48,427 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:26:48,428 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:26:48,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:26:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:26:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:26:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:26:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:26:48,433 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 15:26:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:48,433 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:26:48,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:26:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:26:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:26:48,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:48,434 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:26:48,434 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:48,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 15:26:48,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:48,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:48,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:48,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:48,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:48,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:48,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:48,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:48,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:48,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:48,975 INFO L192 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 [2018-12-03 15:26:48,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:48,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:49,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:26:49,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:49,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:49,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:50,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:50,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 15:26:50,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:50,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:26:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:26:50,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:26:50,502 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 15:26:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:50,967 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:26:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:26:50,968 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 15:26:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:50,969 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:26:50,969 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:26:50,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:26:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:26:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:26:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:26:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:26:50,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 15:26:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:50,975 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:26:50,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:26:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:26:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:26:50,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:50,976 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 15:26:50,976 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:50,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:50,977 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 15:26:50,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:50,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:50,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:50,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:50,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:51,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:51,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:51,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:51,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:51,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:51,366 INFO L192 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 [2018-12-03 15:26:51,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:51,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:51,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:51,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:51,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:51,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:53,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:53,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 15:26:53,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:53,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:26:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:26:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:26:53,424 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 15:26:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:53,755 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:26:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:26:53,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 15:26:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:53,757 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:26:53,757 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:26:53,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:26:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:26:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:26:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:26:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:26:53,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 15:26:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:53,764 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:26:53,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:26:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:26:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:26:53,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:53,764 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:26:53,765 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:53,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 15:26:53,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:53,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:53,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:53,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:53,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:54,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:54,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:54,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:54,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:54,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:54,645 INFO L192 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 [2018-12-03 15:26:54,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:54,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:54,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:54,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:56,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:56,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 15:26:56,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:56,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:26:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:26:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:26:56,889 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 15:26:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:57,139 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:26:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:26:57,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:26:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:57,140 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:26:57,140 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:26:57,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:26:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:26:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:26:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:26:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:26:57,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 15:26:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:57,145 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:26:57,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:26:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:26:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:26:57,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:57,146 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:26:57,146 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:57,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 15:26:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:57,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:57,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:57,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:57,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:57,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:57,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:57,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:57,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:57,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:57,573 INFO L192 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 [2018-12-03 15:26:57,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:57,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:57,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:26:57,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:57,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:57,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 15:27:00,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:00,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:27:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:27:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:27:00,349 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 15:27:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:00,583 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:27:00,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:27:00,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 15:27:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:00,585 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:27:00,585 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:27:00,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:27:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:27:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:27:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:27:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:27:00,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 15:27:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:00,590 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:27:00,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:27:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:27:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:27:00,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:00,591 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:27:00,591 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:00,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 15:27:00,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:00,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:00,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:01,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:01,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:01,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:01,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:01,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:01,345 INFO L192 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 [2018-12-03 15:27:01,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:01,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:01,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:01,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:01,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:01,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:04,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:04,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 15:27:04,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:04,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:27:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:27:04,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:27:04,457 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 15:27:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:04,753 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:27:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:27:04,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:27:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:04,755 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:27:04,755 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:27:04,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:27:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:27:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:27:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:27:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:27:04,761 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 15:27:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:04,761 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:27:04,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:27:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:27:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:27:04,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:04,762 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 15:27:04,762 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:04,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 15:27:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:04,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:04,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:05,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:05,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:05,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:05,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:05,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:05,586 INFO L192 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 [2018-12-03 15:27:05,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:05,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:05,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:05,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:08,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:08,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 15:27:08,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:08,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:27:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:27:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:27:08,732 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 15:27:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:09,064 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:27:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:27:09,065 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 15:27:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:09,066 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:27:09,066 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:27:09,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:27:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:27:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:27:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:27:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:27:09,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 15:27:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:09,070 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:27:09,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:27:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:27:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:27:09,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:09,070 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:27:09,071 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:09,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 15:27:09,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:09,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:09,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:09,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:09,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:09,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:09,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:09,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:09,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:09,562 INFO L192 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 [2018-12-03 15:27:09,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:09,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:09,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:27:09,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:09,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:09,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:13,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:13,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 15:27:13,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:13,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:27:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:27:13,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:27:13,900 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 15:27:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:14,269 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:27:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:27:14,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 15:27:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:14,272 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:27:14,272 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:27:14,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:27:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:27:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:27:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:27:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:27:14,277 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 15:27:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:14,278 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:27:14,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:27:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:27:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:27:14,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:14,279 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 15:27:14,279 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:14,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 15:27:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:14,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:14,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:14,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:14,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:14,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:14,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:14,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:14,797 INFO L192 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 [2018-12-03 15:27:14,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:14,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:14,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:14,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:14,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:14,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:19,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:19,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 15:27:19,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:19,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:27:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:27:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:27:19,156 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 15:27:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:19,473 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:27:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:27:19,474 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 15:27:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:19,475 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:27:19,475 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:27:19,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:27:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:27:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:27:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:27:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:27:19,483 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 15:27:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:19,484 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:27:19,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:27:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:27:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:27:19,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:19,485 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:27:19,485 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:19,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 15:27:19,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:19,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:19,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:20,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:20,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:20,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:20,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:20,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:20,075 INFO L192 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 [2018-12-03 15:27:20,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:20,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:20,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:20,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:24,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:24,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 15:27:24,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:24,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:27:24,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:27:24,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:27:24,542 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 15:27:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:24,883 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:27:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:27:24,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 15:27:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:24,886 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:27:24,886 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:27:24,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:27:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:27:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:27:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:27:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:27:24,891 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 15:27:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:24,891 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:27:24,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:27:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:27:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:27:24,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:24,892 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 15:27:24,893 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:24,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 15:27:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:24,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:26,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:26,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:26,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:26,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:26,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:26,602 INFO L192 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 [2018-12-03 15:27:26,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:26,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:28,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:27:28,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:28,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:28,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:33,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:33,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 15:27:33,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:33,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:27:33,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:27:33,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:27:33,072 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 15:27:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:33,576 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:27:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:27:33,577 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 15:27:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:33,578 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:27:33,578 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:27:33,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:27:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:27:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:27:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:27:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:27:33,584 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 15:27:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:33,584 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:27:33,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:27:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:27:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:27:33,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:33,585 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:27:33,585 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:33,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 15:27:33,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:33,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:33,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:34,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:34,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:34,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:34,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:34,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:34,389 INFO L192 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 [2018-12-03 15:27:34,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:34,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:34,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:34,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:34,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:34,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:39,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:39,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 15:27:39,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:39,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:27:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:27:39,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:27:39,660 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 15:27:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:40,083 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:27:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:27:40,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 15:27:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:40,084 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:27:40,084 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:27:40,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:27:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:27:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:27:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:27:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:27:40,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 15:27:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:40,089 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:27:40,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:27:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:27:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:27:40,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:40,089 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 15:27:40,090 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:40,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 15:27:40,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:40,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:40,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:40,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:40,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:40,904 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:40,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:40,904 INFO L192 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 [2018-12-03 15:27:40,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:40,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:40,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:41,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:45,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:45,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 15:27:45,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:45,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:27:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:27:45,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:27:45,945 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 15:27:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:46,766 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:27:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:27:46,767 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 15:27:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:46,767 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:27:46,767 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:27:46,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:27:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:27:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:27:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:27:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:27:46,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 15:27:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:46,773 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:27:46,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:27:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:27:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:27:46,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:46,774 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:27:46,774 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:46,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 15:27:46,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:46,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:46,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:47,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:47,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:47,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:47,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:47,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:47,682 INFO L192 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 [2018-12-03 15:27:47,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:47,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:48,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:27:48,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:48,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:48,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:54,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:54,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 15:27:54,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:54,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:27:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:27:54,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:27:54,804 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 15:27:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:55,514 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:27:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:27:55,514 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 15:27:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:55,515 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:27:55,515 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:27:55,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:27:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:27:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:27:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:27:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:27:55,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 15:27:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:55,523 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:27:55,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:27:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:27:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:27:55,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:55,524 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 15:27:55,525 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:55,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 15:27:55,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:55,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:55,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:55,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:55,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:56,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:56,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:56,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:56,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:56,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:56,293 INFO L192 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 [2018-12-03 15:27:56,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:56,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:56,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:56,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:56,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:56,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:03,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:03,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 15:28:03,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:03,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:28:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:28:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:28:03,294 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 15:28:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:03,947 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:28:03,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:28:03,947 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 15:28:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:03,948 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:28:03,948 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:28:03,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:28:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:28:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:28:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:28:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:28:03,955 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 15:28:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:03,955 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:28:03,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:28:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:28:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:28:03,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:03,956 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:28:03,956 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:03,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 15:28:03,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:03,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:03,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:03,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:03,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:04,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:04,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:04,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:04,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:04,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:04,839 INFO L192 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 [2018-12-03 15:28:04,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:04,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:28:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:04,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:05,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:12,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 15:28:12,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:12,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:28:12,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:28:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:28:12,270 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 15:28:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:12,870 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:28:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:28:12,872 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 15:28:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:12,873 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:28:12,873 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:28:12,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:28:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:28:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:28:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:28:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:28:12,877 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 15:28:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:12,878 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:28:12,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:28:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:28:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:28:12,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:12,878 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 15:28:12,879 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:12,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 15:28:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:12,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:12,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:13,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:13,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:13,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:13,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:13,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:13,890 INFO L192 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 [2018-12-03 15:28:13,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:28:13,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:28:14,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:28:14,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:14,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:14,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:21,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:21,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 15:28:21,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:21,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:28:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:28:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:28:21,699 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 15:28:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:22,330 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:28:22,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:28:22,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 15:28:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:22,332 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:28:22,332 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:28:22,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:28:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:28:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:28:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:28:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:28:22,337 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 15:28:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:22,337 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:28:22,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:28:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:28:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:28:22,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:22,338 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:28:22,338 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:22,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 15:28:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:22,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:22,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:23,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:23,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:23,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:23,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:23,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:23,311 INFO L192 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 [2018-12-03 15:28:23,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:28:23,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:28:23,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:28:23,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:23,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:23,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:31,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:31,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 15:28:31,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:31,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:28:31,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:28:31,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:28:31,620 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 15:28:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:32,316 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:28:32,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:28:32,316 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 15:28:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:32,317 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:28:32,317 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:28:32,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:28:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:28:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:28:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:28:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:28:32,323 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 15:28:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:32,323 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:28:32,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:28:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:28:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:28:32,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:32,324 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 15:28:32,324 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:32,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 15:28:32,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:32,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:32,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:32,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:32,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:34,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:34,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:34,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:34,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:34,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:34,422 INFO L192 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 [2018-12-03 15:28:34,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:34,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:28:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:34,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:34,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:42,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:42,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 15:28:42,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:42,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:28:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:28:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:28:42,862 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 15:28:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:43,544 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:28:43,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:28:43,545 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 15:28:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:43,545 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:28:43,545 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:28:43,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:28:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:28:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:28:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:28:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:28:43,552 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 15:28:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:43,552 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:28:43,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:28:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:28:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:28:43,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:43,553 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:28:43,553 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:43,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:43,553 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 15:28:43,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:43,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:43,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:43,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:43,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:44,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:44,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:44,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:44,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:44,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:44,825 INFO L192 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 [2018-12-03 15:28:44,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:28:44,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:28:52,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:28:52,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:52,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:52,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:01,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 15:29:01,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:01,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:29:01,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:29:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:29:01,424 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 15:29:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:02,209 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 15:29:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:29:02,210 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 15:29:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:02,210 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:29:02,210 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:29:02,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:29:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:29:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:29:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:29:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:29:02,216 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 15:29:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:02,216 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:29:02,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:29:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:29:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:29:02,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:02,217 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 15:29:02,218 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:02,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 15:29:02,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:02,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:02,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:03,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:03,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:03,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:03,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:03,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:03,281 INFO L192 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 [2018-12-03 15:29:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:29:03,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:29:03,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:29:03,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:03,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:03,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:13,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:13,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2018-12-03 15:29:13,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:13,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:29:13,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:29:13,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:29:13,529 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 15:29:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:14,350 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:29:14,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:29:14,351 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 15:29:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:14,352 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:29:14,352 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:29:14,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:29:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:29:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:29:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:29:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 15:29:14,357 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 15:29:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:14,357 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 15:29:14,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:29:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 15:29:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:29:14,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:14,358 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 15:29:14,358 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:14,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 15:29:14,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:14,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:14,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:14,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:14,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:15,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:15,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:15,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:15,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:15,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:15,628 INFO L192 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 [2018-12-03 15:29:15,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:15,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:29:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:15,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:15,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 15:29:26,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:29:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:29:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:29:26,265 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 15:29:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:27,100 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 15:29:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:29:27,101 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 15:29:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:27,101 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:29:27,102 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:29:27,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:29:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:29:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:29:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:29:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:29:27,107 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 15:29:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:27,107 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:29:27,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:29:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:29:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:29:27,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:27,108 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 15:29:27,109 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:27,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 15:29:27,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:27,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:28,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:28,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:28,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:28,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:28,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:28,381 INFO L192 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 [2018-12-03 15:29:28,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:29:28,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:29:29,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:29:29,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:29,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:29,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 68 [2018-12-03 15:29:40,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:40,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:29:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:29:40,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:29:40,405 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 15:29:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:41,424 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 15:29:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:29:41,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 15:29:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:41,425 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:29:41,425 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:29:41,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:29:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:29:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:29:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:29:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 15:29:41,434 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 15:29:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:41,434 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 15:29:41,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:29:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 15:29:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:29:41,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:41,435 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 15:29:41,435 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:41,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-03 15:29:41,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:41,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:41,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:42,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:42,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:42,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:42,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:42,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:42,700 INFO L192 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 [2018-12-03 15:29:42,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:29:42,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:29:42,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:29:42,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:42,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:42,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:55,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 15:29:55,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:55,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:29:55,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:29:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:29:55,264 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-12-03 15:29:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:56,307 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 15:29:56,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:29:56,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-12-03 15:29:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:56,308 INFO L225 Difference]: With dead ends: 40 [2018-12-03 15:29:56,308 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:29:56,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:29:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:29:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:29:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:29:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 15:29:56,312 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 15:29:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:56,312 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 15:29:56,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:29:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 15:29:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:29:56,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:56,313 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 15:29:56,313 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:56,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-03 15:29:56,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:56,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:56,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:56,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:56,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:57,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:57,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:57,622 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:57,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:57,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:57,623 INFO L192 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 [2018-12-03 15:29:57,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:57,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:29:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:57,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:57,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:10,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:10,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-12-03 15:30:10,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:10,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:30:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:30:10,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:30:10,450 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 15:30:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:11,628 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 15:30:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:30:11,629 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 15:30:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:11,629 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:30:11,629 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:30:11,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:30:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:30:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:30:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:30:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 15:30:11,634 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 15:30:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:11,635 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 15:30:11,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:30:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 15:30:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:30:11,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:11,636 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 15:30:11,636 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:11,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-03 15:30:11,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:11,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:11,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:13,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:13,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:13,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:13,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:13,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:13,166 INFO L192 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 [2018-12-03 15:30:13,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:30:13,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:30:18,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:30:18,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:18,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:18,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:23,649 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 15:30:43,545 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:31:11,976 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:32:01,006 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:32:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:01,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:01,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 15:32:01,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:01,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:32:01,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:32:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1513, Invalid=4010, Unknown=27, NotChecked=0, Total=5550 [2018-12-03 15:32:01,031 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-12-03 15:32:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:02,129 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 15:32:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:32:02,130 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-12-03 15:32:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:02,131 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:32:02,131 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:32:02,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 103.8s TimeCoverageRelationStatistics Valid=1513, Invalid=4010, Unknown=27, NotChecked=0, Total=5550 [2018-12-03 15:32:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:32:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:32:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:32:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 15:32:02,136 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 15:32:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:02,136 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 15:32:02,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:32:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 15:32:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:32:02,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:02,136 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 15:32:02,137 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:02,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-03 15:32:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:02,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:02,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:04,298 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:04,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:04,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:04,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:04,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:04,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:04,299 INFO L192 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 [2018-12-03 15:32:04,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:32:04,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:32:04,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:32:04,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:04,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:04,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:18,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:18,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 76 [2018-12-03 15:32:18,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:18,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:32:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:32:18,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:32:18,242 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 15:32:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:19,463 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 15:32:19,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:32:19,464 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 15:32:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:19,465 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:32:19,465 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:32:19,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:32:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:32:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:32:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:32:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 15:32:19,469 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 15:32:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:19,469 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 15:32:19,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:32:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 15:32:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:32:19,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:19,470 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 15:32:19,470 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:19,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-03 15:32:19,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:19,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:19,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:19,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:19,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:20,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:20,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:20,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:20,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:20,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:20,977 INFO L192 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 [2018-12-03 15:32:20,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:20,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:32:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:21,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:21,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:35,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:35,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 15:32:35,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:35,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:32:35,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:32:35,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:32:35,811 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-12-03 15:32:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:37,003 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 15:32:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:32:37,004 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-12-03 15:32:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:37,005 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:32:37,005 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:32:37,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:32:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:32:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:32:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:32:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 15:32:37,009 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 15:32:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:37,009 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 15:32:37,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:32:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 15:32:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:32:37,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:37,010 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 15:32:37,010 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:37,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-03 15:32:37,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:37,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:37,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:38,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:38,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:38,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:38,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:38,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:38,595 INFO L192 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 [2018-12-03 15:32:38,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:32:38,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:32:59,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:32:59,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:59,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:59,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:14,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 80 [2018-12-03 15:33:14,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:14,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:33:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:33:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1758, Invalid=4722, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:33:14,877 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 15:33:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:16,266 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 15:33:16,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:33:16,267 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 15:33:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:16,267 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:33:16,268 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:33:16,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1758, Invalid=4722, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:33:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:33:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:33:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:33:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 15:33:16,272 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 15:33:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:16,273 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 15:33:16,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:33:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 15:33:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:33:16,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:16,274 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 15:33:16,274 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:16,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-03 15:33:16,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:16,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:16,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:17,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:17,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:17,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:17,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:17,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:17,978 INFO L192 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 [2018-12-03 15:33:17,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:17,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:18,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:18,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:18,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:18,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:35,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:35,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 15:33:35,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:35,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:33:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:33:35,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1843, Invalid=4963, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:33:35,616 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-12-03 15:33:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:37,080 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 15:33:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:33:37,080 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-12-03 15:33:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:37,081 INFO L225 Difference]: With dead ends: 46 [2018-12-03 15:33:37,081 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:33:37,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=1843, Invalid=4963, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:33:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:33:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:33:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:33:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 15:33:37,085 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 15:33:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:37,085 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 15:33:37,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:33:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 15:33:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:33:37,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:37,086 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 15:33:37,086 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:37,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-03 15:33:37,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:37,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:37,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:37,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:37,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:38,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:38,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:38,853 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:38,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:38,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:38,853 INFO L192 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 [2018-12-03 15:33:38,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:38,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:38,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:38,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 84 [2018-12-03 15:33:57,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:57,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:33:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:33:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1930, Invalid=5210, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:33:57,327 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 15:33:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:58,712 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 15:33:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:33:58,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 15:33:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:58,714 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:33:58,714 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:33:58,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=1930, Invalid=5210, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:33:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:33:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:33:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:33:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 15:33:58,718 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 15:33:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:58,719 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 15:33:58,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:33:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 15:33:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:33:58,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:58,719 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 15:33:58,719 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:58,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-03 15:33:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:58,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:58,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:00,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:00,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:00,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:00,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:00,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:00,470 INFO L192 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 [2018-12-03 15:34:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:00,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:34,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:34:34,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:34,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:34,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:53,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:53,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 15:34:53,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:53,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:34:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:34:53,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=5463, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:34:53,545 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-12-03 15:34:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:55,004 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 15:34:55,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:34:55,005 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 15:34:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:55,006 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:34:55,006 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:34:55,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=2019, Invalid=5463, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:34:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:34:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:34:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:34:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 15:34:55,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 15:34:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:55,010 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 15:34:55,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:34:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 15:34:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:34:55,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:55,011 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 15:34:55,011 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:55,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-03 15:34:55,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:55,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:55,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:56,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:56,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:56,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:56,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:56,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:56,818 INFO L192 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 [2018-12-03 15:34:56,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:56,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:56,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:56,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:56,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:56,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:15,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:15,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 88 [2018-12-03 15:35:15,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:15,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:35:15,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:35:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=5722, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:35:15,867 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-12-03 15:35:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:17,412 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 15:35:17,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:35:17,413 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-12-03 15:35:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:17,414 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:35:17,414 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:35:17,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=2110, Invalid=5722, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:35:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:35:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:35:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:35:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 15:35:17,418 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 15:35:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:17,418 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 15:35:17,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:35:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 15:35:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:35:17,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:17,419 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 15:35:17,419 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:17,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-03 15:35:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:17,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:17,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:17,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:19,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:19,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:19,470 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:19,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:19,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:19,470 INFO L192 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 [2018-12-03 15:35:19,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:19,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:19,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:19,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:38,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:38,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 15:35:38,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:38,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:35:38,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:35:38,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2203, Invalid=5987, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:35:38,905 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-12-03 15:35:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:40,588 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 15:35:40,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:35:40,589 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-12-03 15:35:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:40,590 INFO L225 Difference]: With dead ends: 50 [2018-12-03 15:35:40,590 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:35:40,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=2203, Invalid=5987, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:35:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:35:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:35:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:35:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 15:35:40,594 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 15:35:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:40,594 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 15:35:40,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:35:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 15:35:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:35:40,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:40,595 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 15:35:40,595 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:40,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-03 15:35:40,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:40,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:40,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:40,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:40,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:42,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:42,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:42,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:42,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,623 INFO L192 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 [2018-12-03 15:35:42,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:42,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:27,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 15:36:27,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:27,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:27,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:47,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 92 [2018-12-03 15:36:47,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:47,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:36:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:36:47,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2298, Invalid=6258, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 15:36:47,329 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-12-03 15:36:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:49,018 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 15:36:49,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:36:49,018 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-12-03 15:36:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:49,019 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:36:49,019 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:36:49,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=2298, Invalid=6258, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 15:36:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:36:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:36:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:36:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 15:36:49,024 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 15:36:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:49,025 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 15:36:49,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:36:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 15:36:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:36:49,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:49,025 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 15:36:49,026 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:49,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-03 15:36:49,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:49,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:49,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:51,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:51,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:51,569 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:51,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:51,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:51,569 INFO L192 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 [2018-12-03 15:36:51,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:51,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:51,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:51,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:51,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:51,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:13,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:13,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 15:37:13,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:13,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:37:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:37:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2395, Invalid=6535, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:37:13,292 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-12-03 15:37:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:15,038 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 15:37:15,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:37:15,039 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-12-03 15:37:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:15,040 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:37:15,040 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:37:15,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=2395, Invalid=6535, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:37:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:37:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:37:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:37:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 15:37:15,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 15:37:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:15,045 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 15:37:15,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:37:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 15:37:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:37:15,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:15,046 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 15:37:15,046 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:15,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:15,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-03 15:37:15,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:15,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:17,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:17,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:17,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:17,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:17,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:17,543 INFO L192 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 [2018-12-03 15:37:17,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:17,553 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:17,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:17,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:40,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:40,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2018-12-03 15:37:40,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:40,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:37:40,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:37:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2494, Invalid=6818, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:37:40,996 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-12-03 15:37:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:42,940 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 15:37:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:37:42,940 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-12-03 15:37:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:42,941 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:37:42,941 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:37:42,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=2494, Invalid=6818, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:37:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:37:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:37:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:37:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 15:37:42,946 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 15:37:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:42,946 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 15:37:42,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:37:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 15:37:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:37:42,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:42,947 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 15:37:42,947 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:42,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-03 15:37:42,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:42,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:42,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:42,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:42,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:45,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:45,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:45,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:45,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:45,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:45,364 INFO L192 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 [2018-12-03 15:37:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:45,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:00,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:39:00,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:00,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:00,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:25,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 15:39:25,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:25,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:39:25,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:39:25,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2595, Invalid=7107, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:39:25,024 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-12-03 15:39:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:26,991 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 15:39:26,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:39:26,992 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-12-03 15:39:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:26,993 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:39:26,993 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:39:26,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=2595, Invalid=7107, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:39:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:39:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:39:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:39:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 15:39:26,998 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 15:39:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:26,998 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 15:39:26,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:39:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 15:39:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:39:26,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:26,999 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 15:39:26,999 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:26,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-03 15:39:27,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:27,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:27,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:29,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:29,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:29,330 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:29,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:29,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:29,331 INFO L192 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 [2018-12-03 15:39:29,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:39:29,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:39:29,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:39:29,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:29,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:29,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:54,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:54,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 100 [2018-12-03 15:39:54,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:54,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:39:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:39:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2698, Invalid=7402, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:39:54,779 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-12-03 15:39:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:57,025 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 15:39:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:39:57,025 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-03 15:39:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:57,026 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:39:57,026 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:39:57,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=2698, Invalid=7402, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:39:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:39:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:39:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:39:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 15:39:57,033 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 15:39:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:57,033 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 15:39:57,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:39:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 15:39:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:39:57,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:57,034 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 15:39:57,034 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:57,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-03 15:39:57,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:57,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:57,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:57,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:57,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:59,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:59,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:59,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:59,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:59,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:59,491 INFO L192 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 [2018-12-03 15:39:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:59,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:59,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:59,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:26,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:26,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 102 [2018-12-03 15:40:26,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:26,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:40:26,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:40:26,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2803, Invalid=7703, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:40:26,188 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-12-03 15:40:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:28,305 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 15:40:28,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:40:28,305 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-12-03 15:40:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:28,306 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:40:28,306 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:40:28,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=2803, Invalid=7703, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:40:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:40:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:40:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:40:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 15:40:28,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 15:40:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:28,311 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 15:40:28,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:40:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 15:40:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:40:28,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:28,311 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 15:40:28,311 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:28,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-03 15:40:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:28,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:28,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:28,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:30,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:30,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:30,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:30,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:30,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:30,798 INFO L192 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 [2018-12-03 15:40:30,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:40:30,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)