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/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 13:51:48,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:51:48,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:51:48,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:51:48,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:51:48,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:51:48,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:51:48,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:51:48,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:51:48,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:51:48,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:51:48,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:51:48,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:51:48,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:51:48,814 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:51:48,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:51:48,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:51:48,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:51:48,826 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:51:48,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:51:48,830 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:51:48,831 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:51:48,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:51:48,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:51:48,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:51:48,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:51:48,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:51:48,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:51:48,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:51:48,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:51:48,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:51:48,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:51:48,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:51:48,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:51:48,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:51:48,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:51:48,847 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 13:51:48,874 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:51:48,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:51:48,877 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:51:48,878 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:51:48,878 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:51:48,878 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:51:48,878 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:51:48,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:51:48,879 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:51:48,879 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:51:48,879 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:51:48,879 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:51:48,880 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:51:48,881 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:51:48,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:51:48,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:51:48,882 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:51:48,882 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:51:48,882 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:51:48,884 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:51:48,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:51:48,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:51:48,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:51:48,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:51:48,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:51:48,886 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:51:48,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:51:48,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:51:48,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:51:48,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:51:48,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:51:48,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:51:48,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:51:48,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:51:48,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:51:48,889 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:51:48,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:51:48,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:51:48,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:51:48,891 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:51:48,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:51:48,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:51:48,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:51:48,946 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:51:48,947 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:51:48,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-01-08 13:51:48,948 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-08 13:51:48,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:51:48,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:51:48,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:48,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:51:48,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:51:49,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:51:49,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:51:49,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... [2019-01-08 13:51:49,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:51:49,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:51:49,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:51:49,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:51:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 13:51:49,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 13:51:49,385 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 13:51:49,385 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-08 13:51:49,387 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49 BoogieIcfgContainer [2019-01-08 13:51:49,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:51:49,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:51:49,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:51:49,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:51:49,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:48" (1/2) ... [2019-01-08 13:51:49,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4055f7 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:51:49, skipping insertion in model container [2019-01-08 13:51:49,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49" (2/2) ... [2019-01-08 13:51:49,396 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-08 13:51:49,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:51:49,416 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 13:51:49,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 13:51:49,466 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:51:49,466 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:51:49,466 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:51:49,466 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:51:49,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:51:49,467 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:51:49,467 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:51:49,467 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:51:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-08 13:51:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 13:51:49,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:49,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 13:51:49,492 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-08 13:51:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:49,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:51:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 13:51:49,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:49,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:51:49,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:51:49,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:49,648 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-08 13:51:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:49,739 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-08 13:51:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:51:49,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-08 13:51:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:49,754 INFO L225 Difference]: With dead ends: 12 [2019-01-08 13:51:49,754 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 13:51:49,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 13:51:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-08 13:51:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 13:51:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-08 13:51:49,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-08 13:51:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:49,795 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-08 13:51:49,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:51:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-08 13:51:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:51:49,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:49,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 13:51:49,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-08 13:51:49,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:49,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 13:51:49,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:49,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:49,970 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 13:51:49,973 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-08 13:51:50,066 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:51:50,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:51:50,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:51:50,399 INFO L272 AbstractInterpreter]: Visited 6 different actions 19 times. Merged at 4 different actions 8 times. Never widened. Performed 176 root evaluator evaluations with a maximum evaluation depth of 6. Performed 176 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 13:51:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:51:50,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:50,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 13:51:50,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 13:51:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-08 13:51:50,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:50,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:51:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:51:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 13:51:50,551 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-08 13:51:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,616 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-08 13:51:50,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 13:51:50,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 13:51:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,618 INFO L225 Difference]: With dead ends: 13 [2019-01-08 13:51:50,618 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 13:51:50,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 13:51:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 13:51:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 13:51:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 13:51:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-08 13:51:50,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-08 13:51:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,623 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-08 13:51:50,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:51:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-08 13:51:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 13:51:50,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,624 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-08 13:51:50,625 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-08 13:51:50,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 13:51:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:50,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:50,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:50,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:50,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:50,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:50,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 13:51:50,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:50,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 13:51:50,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 13:51:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-08 13:51:51,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 13:51:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 13:51:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:51:51,049 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-08 13:51:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,221 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-08 13:51:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:51:51,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-08 13:51:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,223 INFO L225 Difference]: With dead ends: 16 [2019-01-08 13:51:51,223 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 13:51:51,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:51:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 13:51:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-08 13:51:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 13:51:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-08 13:51:51,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-08 13:51:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,228 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-08 13:51:51,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 13:51:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-08 13:51:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 13:51:51,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,229 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-08 13:51:51,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-08 13:51:51,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 13:51:51,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:51,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:51,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:51,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:51,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:51,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:51,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:51,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:51,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 13:51:51,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 13:51:51,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-08 13:51:51,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 13:51:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 13:51:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 13:51:51,562 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-08 13:51:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,654 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-08 13:51:51,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 13:51:51,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-08 13:51:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,656 INFO L225 Difference]: With dead ends: 19 [2019-01-08 13:51:51,656 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 13:51:51,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 13:51:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 13:51:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-08 13:51:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 13:51:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-08 13:51:51,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-08 13:51:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,660 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-08 13:51:51,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 13:51:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-08 13:51:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-08 13:51:51,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,662 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-08 13:51:51,662 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-08 13:51:51,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 13:51:51,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:51,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:51,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:51,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:51,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:51,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 13:51:51,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 13:51:51,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-08 13:51:51,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 13:51:51,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 13:51:51,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 13:51:51,973 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-08 13:51:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:52,049 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-08 13:51:52,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 13:51:52,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-08 13:51:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:52,052 INFO L225 Difference]: With dead ends: 22 [2019-01-08 13:51:52,052 INFO L226 Difference]: Without dead ends: 15 [2019-01-08 13:51:52,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 13:51:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-08 13:51:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-08 13:51:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-08 13:51:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-08 13:51:52,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-08 13:51:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:52,057 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-08 13:51:52,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 13:51:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-08 13:51:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-08 13:51:52,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:52,058 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-08 13:51:52,058 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-08 13:51:52,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 13:51:52,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:52,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:52,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:52,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:52,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:52,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:52,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 13:51:52,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:52,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 13:51:52,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 13:51:52,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:52,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-08 13:51:52,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:52,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 13:51:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 13:51:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:51:52,676 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-08 13:51:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:52,728 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-08 13:51:52,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 13:51:52,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-08 13:51:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:52,730 INFO L225 Difference]: With dead ends: 25 [2019-01-08 13:51:52,730 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 13:51:52,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:51:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 13:51:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-08 13:51:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 13:51:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-08 13:51:52,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-08 13:51:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:52,735 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-08 13:51:52,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 13:51:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-08 13:51:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 13:51:52,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:52,736 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-08 13:51:52,736 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-08 13:51:52,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:52,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 13:51:52,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:52,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:52,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:52,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:52,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:52,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:52,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:52,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:52,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 13:51:52,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 13:51:53,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:53,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-08 13:51:53,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:53,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 13:51:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 13:51:53,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 13:51:53,308 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-08 13:51:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:53,419 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-08 13:51:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 13:51:53,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-08 13:51:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:53,420 INFO L225 Difference]: With dead ends: 28 [2019-01-08 13:51:53,420 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 13:51:53,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 13:51:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 13:51:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-08 13:51:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 13:51:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-08 13:51:53,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-08 13:51:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:53,424 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-08 13:51:53,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 13:51:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-08 13:51:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-08 13:51:53,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:53,426 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-08 13:51:53,426 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-08 13:51:53,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:53,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 13:51:53,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:53,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:53,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:53,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:53,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:53,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 13:51:53,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 13:51:53,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:53,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-08 13:51:53,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:53,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 13:51:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 13:51:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 13:51:53,909 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-08 13:51:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:53,963 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-08 13:51:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 13:51:53,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-08 13:51:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:53,967 INFO L225 Difference]: With dead ends: 31 [2019-01-08 13:51:53,968 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 13:51:53,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 13:51:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 13:51:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-08 13:51:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 13:51:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-08 13:51:53,973 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-08 13:51:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:53,973 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-08 13:51:53,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 13:51:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-08 13:51:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-08 13:51:53,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:53,974 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-08 13:51:53,974 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-08 13:51:53,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:53,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:53,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 13:51:54,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:54,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:54,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:54,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:54,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:54,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:54,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-08 13:51:54,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:54,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 13:51:54,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 13:51:54,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:54,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-08 13:51:54,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:54,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 13:51:54,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 13:51:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:51:54,476 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-08 13:51:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:54,695 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-08 13:51:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 13:51:54,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-08 13:51:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:54,697 INFO L225 Difference]: With dead ends: 34 [2019-01-08 13:51:54,697 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 13:51:54,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:51:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 13:51:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-08 13:51:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 13:51:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-08 13:51:54,702 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-08 13:51:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:54,702 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-08 13:51:54,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 13:51:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-08 13:51:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-08 13:51:54,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:54,703 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-08 13:51:54,703 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-08 13:51:54,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 13:51:54,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:54,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:54,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:54,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:54,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:54,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:54,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:54,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:54,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 13:51:54,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 13:51:55,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:55,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-08 13:51:55,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 13:51:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 13:51:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 13:51:55,512 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-08 13:51:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:55,585 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-08 13:51:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 13:51:55,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-08 13:51:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:55,592 INFO L225 Difference]: With dead ends: 37 [2019-01-08 13:51:55,592 INFO L226 Difference]: Without dead ends: 25 [2019-01-08 13:51:55,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 13:51:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-08 13:51:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-08 13:51:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 13:51:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-08 13:51:55,600 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-08 13:51:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:55,600 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-08 13:51:55,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 13:51:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-08 13:51:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-08 13:51:55,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:55,607 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-08 13:51:55,607 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-08 13:51:55,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:55,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:55,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 13:51:55,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:55,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:55,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:55,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:55,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:55,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:55,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:55,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:55,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 13:51:56,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 13:51:56,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:56,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-08 13:51:56,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:56,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 13:51:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 13:51:56,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 13:51:56,620 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-08 13:51:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:56,675 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-08 13:51:56,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 13:51:56,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-08 13:51:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:56,677 INFO L225 Difference]: With dead ends: 40 [2019-01-08 13:51:56,677 INFO L226 Difference]: Without dead ends: 27 [2019-01-08 13:51:56,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 13:51:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-08 13:51:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-08 13:51:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-08 13:51:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-08 13:51:56,682 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-08 13:51:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:56,682 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-08 13:51:56,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 13:51:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-08 13:51:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-08 13:51:56,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:56,683 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-08 13:51:56,683 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:56,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-08 13:51:56,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 13:51:56,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:56,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:56,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:56,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:56,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:56,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:56,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-08 13:51:56,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:56,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 13:51:56,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 13:51:57,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:57,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-08 13:51:57,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:57,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 13:51:57,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 13:51:57,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:51:57,219 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-08 13:51:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:57,295 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-08 13:51:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-08 13:51:57,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-08 13:51:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:57,297 INFO L225 Difference]: With dead ends: 43 [2019-01-08 13:51:57,297 INFO L226 Difference]: Without dead ends: 29 [2019-01-08 13:51:57,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:51:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-08 13:51:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-08 13:51:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-08 13:51:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-08 13:51:57,303 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-08 13:51:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:57,303 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-08 13:51:57,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 13:51:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-08 13:51:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-08 13:51:57,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:57,304 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-08 13:51:57,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-08 13:51:57,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:57,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:57,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:57,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:57,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 13:51:57,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:57,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:57,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:57,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:57,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:57,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:57,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:57,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:57,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:57,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:57,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 13:51:57,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 13:51:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:57,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-08 13:51:57,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:57,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-08 13:51:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-08 13:51:57,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 13:51:57,983 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-08 13:51:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:58,149 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-08 13:51:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 13:51:58,149 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-08 13:51:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:58,150 INFO L225 Difference]: With dead ends: 46 [2019-01-08 13:51:58,150 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 13:51:58,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 13:51:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 13:51:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-08 13:51:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 13:51:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-08 13:51:58,156 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-08 13:51:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:58,156 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-08 13:51:58,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-08 13:51:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-08 13:51:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 13:51:58,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:58,157 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-08 13:51:58,158 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-08 13:51:58,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:58,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:58,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 13:51:58,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:58,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:58,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:58,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:58,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:58,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:58,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:58,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:58,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 13:51:58,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 13:51:59,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:59,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-08 13:51:59,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:59,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-08 13:51:59,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-08 13:51:59,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 13:51:59,137 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-08 13:51:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:59,341 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-08 13:51:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 13:51:59,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-08 13:51:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:59,343 INFO L225 Difference]: With dead ends: 49 [2019-01-08 13:51:59,343 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 13:51:59,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 13:51:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 13:51:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-08 13:51:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 13:51:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-08 13:51:59,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-08 13:51:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:59,350 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-08 13:51:59,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-08 13:51:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-08 13:51:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-08 13:51:59,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:59,351 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-08 13:51:59,351 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:59,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:59,352 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-08 13:51:59,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:59,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:59,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 13:51:59,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:59,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:59,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:59,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:59,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:59,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:51:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:59,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:59,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-08 13:51:59,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:59,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 13:51:59,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 13:52:00,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:00,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-08 13:52:00,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:00,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 13:52:00,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 13:52:00,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:52:00,156 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-08 13:52:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:00,227 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-08 13:52:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-08 13:52:00,228 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-08 13:52:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:00,229 INFO L225 Difference]: With dead ends: 52 [2019-01-08 13:52:00,229 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 13:52:00,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:52:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 13:52:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-08 13:52:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 13:52:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-08 13:52:00,234 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-08 13:52:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:00,234 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-08 13:52:00,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 13:52:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-08 13:52:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-08 13:52:00,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:00,235 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-08 13:52:00,235 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:00,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:00,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-08 13:52:00,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:00,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:00,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 13:52:00,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:00,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:00,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:00,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:00,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:00,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:00,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:00,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:00,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:00,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:00,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 13:52:00,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 13:52:00,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:00,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-08 13:52:00,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:00,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-08 13:52:00,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-08 13:52:00,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:52:00,914 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-08 13:52:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:01,018 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-08 13:52:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 13:52:01,019 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-08 13:52:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:01,020 INFO L225 Difference]: With dead ends: 55 [2019-01-08 13:52:01,020 INFO L226 Difference]: Without dead ends: 37 [2019-01-08 13:52:01,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:52:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-08 13:52:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-08 13:52:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 13:52:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-08 13:52:01,024 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-08 13:52:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:01,025 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-08 13:52:01,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-08 13:52:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-08 13:52:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-08 13:52:01,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:01,026 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-08 13:52:01,026 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:01,027 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-08 13:52:01,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:01,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 13:52:01,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:01,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:01,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:01,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:01,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:01,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:01,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:01,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:01,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 13:52:01,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 13:52:02,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:02,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-08 13:52:02,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:02,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-08 13:52:02,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-08 13:52:02,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 13:52:02,503 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-08 13:52:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:02,561 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-08 13:52:02,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 13:52:02,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-08 13:52:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:02,563 INFO L225 Difference]: With dead ends: 58 [2019-01-08 13:52:02,563 INFO L226 Difference]: Without dead ends: 39 [2019-01-08 13:52:02,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 13:52:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-08 13:52:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-08 13:52:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 13:52:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-08 13:52:02,569 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-08 13:52:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:02,569 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-08 13:52:02,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-08 13:52:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-08 13:52:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-08 13:52:02,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:02,570 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-08 13:52:02,571 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-08 13:52:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 13:52:02,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:02,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:02,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:02,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:02,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:02,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:02,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:02,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-08 13:52:02,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:02,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 13:52:02,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 13:52:03,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:03,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-08 13:52:03,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:03,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-08 13:52:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-08 13:52:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:03,909 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-08 13:52:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:03,989 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-08 13:52:03,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 13:52:03,989 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-08 13:52:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:03,990 INFO L225 Difference]: With dead ends: 61 [2019-01-08 13:52:03,990 INFO L226 Difference]: Without dead ends: 41 [2019-01-08 13:52:03,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-08 13:52:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-08 13:52:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 13:52:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-08 13:52:03,996 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-08 13:52:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:03,996 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-08 13:52:03,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-08 13:52:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-08 13:52:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-08 13:52:03,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:03,997 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-08 13:52:03,997 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:03,997 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-08 13:52:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:03,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:03,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:03,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 13:52:04,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:04,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:04,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:04,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:04,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:04,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:04,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:04,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 13:52:04,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 13:52:05,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:05,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-08 13:52:05,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:05,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-08 13:52:05,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-08 13:52:05,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 13:52:05,378 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-08 13:52:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:05,634 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-08 13:52:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-08 13:52:05,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-08 13:52:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:05,634 INFO L225 Difference]: With dead ends: 64 [2019-01-08 13:52:05,635 INFO L226 Difference]: Without dead ends: 43 [2019-01-08 13:52:05,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 13:52:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-08 13:52:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-08 13:52:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-08 13:52:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-08 13:52:05,641 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-08 13:52:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:05,641 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-08 13:52:05,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-08 13:52:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-08 13:52:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-08 13:52:05,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:05,642 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-08 13:52:05,642 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-08 13:52:05,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 13:52:05,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:05,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:05,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:05,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:05,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:05,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:06,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 13:52:06,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 13:52:06,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:06,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-08 13:52:06,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:06,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-08 13:52:06,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-08 13:52:06,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 13:52:06,628 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-08 13:52:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:06,701 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-08 13:52:06,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 13:52:06,702 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-08 13:52:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:06,703 INFO L225 Difference]: With dead ends: 67 [2019-01-08 13:52:06,703 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 13:52:06,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 13:52:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 13:52:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-08 13:52:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 13:52:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-08 13:52:06,708 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-08 13:52:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:06,708 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-08 13:52:06,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-08 13:52:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-08 13:52:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-08 13:52:06,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:06,709 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-08 13:52:06,710 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-08 13:52:06,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 13:52:08,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:08,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:08,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:08,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:08,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:08,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:08,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-08 13:52:08,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:08,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 13:52:08,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 13:52:09,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:09,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-08 13:52:09,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:09,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 13:52:09,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 13:52:09,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:09,199 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-08 13:52:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:09,273 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-08 13:52:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-08 13:52:09,274 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-08 13:52:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:09,275 INFO L225 Difference]: With dead ends: 70 [2019-01-08 13:52:09,275 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 13:52:09,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 13:52:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-08 13:52:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 13:52:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-08 13:52:09,280 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-08 13:52:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:09,280 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-08 13:52:09,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 13:52:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-08 13:52:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-08 13:52:09,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:09,281 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-08 13:52:09,281 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:09,282 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-08 13:52:09,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:09,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 13:52:09,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:09,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:09,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:09,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:09,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:09,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:09,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:09,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:09,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 13:52:09,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 13:52:10,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:10,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-08 13:52:10,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:10,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 13:52:10,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 13:52:10,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 13:52:10,594 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-08 13:52:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:10,678 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-08 13:52:10,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 13:52:10,681 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-08 13:52:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:10,682 INFO L225 Difference]: With dead ends: 73 [2019-01-08 13:52:10,682 INFO L226 Difference]: Without dead ends: 49 [2019-01-08 13:52:10,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 13:52:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-08 13:52:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-08 13:52:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 13:52:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-08 13:52:10,686 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-08 13:52:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:10,686 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-08 13:52:10,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 13:52:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-08 13:52:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 13:52:10,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:10,687 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-08 13:52:10,687 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-08 13:52:10,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:10,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:10,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 13:52:11,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:11,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:11,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:11,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:11,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:11,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:11,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 13:52:11,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 13:52:11,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:11,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-08 13:52:11,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:11,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-08 13:52:11,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-08 13:52:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 13:52:11,798 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-08 13:52:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:11,986 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-08 13:52:11,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-08 13:52:11,989 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-08 13:52:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:11,990 INFO L225 Difference]: With dead ends: 76 [2019-01-08 13:52:11,990 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 13:52:11,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 13:52:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 13:52:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-08 13:52:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 13:52:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-08 13:52:12,004 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-08 13:52:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:12,006 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-08 13:52:12,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-08 13:52:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-08 13:52:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-08 13:52:12,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:12,007 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-08 13:52:12,007 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:12,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-08 13:52:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 13:52:12,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:12,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:12,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:12,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:12,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:12,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:12,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-08 13:52:12,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:12,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 13:52:12,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 13:52:13,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:13,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-08 13:52:13,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:13,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 13:52:13,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 13:52:13,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:13,917 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-08 13:52:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:14,002 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-08 13:52:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 13:52:14,002 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-08 13:52:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:14,003 INFO L225 Difference]: With dead ends: 79 [2019-01-08 13:52:14,003 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 13:52:14,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 13:52:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-08 13:52:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 13:52:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-08 13:52:14,009 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-08 13:52:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:14,009 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-08 13:52:14,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 13:52:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-08 13:52:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-08 13:52:14,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:14,010 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-08 13:52:14,010 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-08 13:52:14,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 13:52:14,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:14,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:14,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:14,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:14,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:14,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:14,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:14,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:14,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:14,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:14,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 13:52:14,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 13:52:15,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:15,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-08 13:52:15,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:15,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-08 13:52:15,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-08 13:52:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 13:52:15,265 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-08 13:52:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:15,386 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-08 13:52:15,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 13:52:15,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-08 13:52:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:15,388 INFO L225 Difference]: With dead ends: 82 [2019-01-08 13:52:15,388 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 13:52:15,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 13:52:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 13:52:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-08 13:52:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 13:52:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-08 13:52:15,392 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-08 13:52:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:15,392 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-08 13:52:15,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-08 13:52:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-08 13:52:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-08 13:52:15,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:15,393 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-08 13:52:15,394 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-08 13:52:15,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:15,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:15,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:15,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:15,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 13:52:15,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:15,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:15,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:15,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:15,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:15,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:15,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 13:52:15,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 13:52:17,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:17,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-08 13:52:17,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:17,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-08 13:52:17,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-08 13:52:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 13:52:17,323 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-08 13:52:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:17,411 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-08 13:52:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-08 13:52:17,412 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-08 13:52:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:17,413 INFO L225 Difference]: With dead ends: 85 [2019-01-08 13:52:17,413 INFO L226 Difference]: Without dead ends: 57 [2019-01-08 13:52:17,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 13:52:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-08 13:52:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-08 13:52:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-08 13:52:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-08 13:52:17,418 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-08 13:52:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:17,418 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-08 13:52:17,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-08 13:52:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-08 13:52:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-08 13:52:17,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:17,419 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-08 13:52:17,420 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-08 13:52:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 13:52:18,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:18,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:18,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:18,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:18,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:18,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:18,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:18,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:18,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-08 13:52:18,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:18,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 13:52:18,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 13:52:19,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:19,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-08 13:52:19,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:19,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 13:52:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 13:52:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:19,344 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-08 13:52:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:19,438 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-08 13:52:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-08 13:52:19,439 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-08 13:52:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:19,440 INFO L225 Difference]: With dead ends: 88 [2019-01-08 13:52:19,440 INFO L226 Difference]: Without dead ends: 59 [2019-01-08 13:52:19,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-08 13:52:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-08 13:52:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 13:52:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-08 13:52:19,443 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-08 13:52:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:19,443 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-08 13:52:19,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 13:52:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-08 13:52:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-08 13:52:19,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:19,444 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-08 13:52:19,444 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-08 13:52:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:19,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:19,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 13:52:19,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:19,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:19,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:19,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:19,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:19,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:19,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:19,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:19,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:19,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:19,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 13:52:19,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 13:52:21,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:21,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-08 13:52:21,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:21,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-08 13:52:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-08 13:52:21,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 13:52:21,087 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-08 13:52:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:21,220 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-08 13:52:21,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 13:52:21,220 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-08 13:52:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:21,221 INFO L225 Difference]: With dead ends: 91 [2019-01-08 13:52:21,221 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 13:52:21,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 13:52:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 13:52:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-08 13:52:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 13:52:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-08 13:52:21,226 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-08 13:52:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:21,226 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-08 13:52:21,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-08 13:52:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-08 13:52:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-08 13:52:21,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:21,227 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-08 13:52:21,227 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-08 13:52:21,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:21,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:21,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 13:52:21,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:21,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:21,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:21,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:21,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:21,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:21,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:21,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 13:52:21,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 13:52:23,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:23,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-08 13:52:23,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:23,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-08 13:52:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-08 13:52:23,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 13:52:23,200 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-08 13:52:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:23,321 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-08 13:52:23,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 13:52:23,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-08 13:52:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:23,323 INFO L225 Difference]: With dead ends: 94 [2019-01-08 13:52:23,323 INFO L226 Difference]: Without dead ends: 63 [2019-01-08 13:52:23,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 13:52:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-08 13:52:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-08 13:52:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 13:52:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-08 13:52:23,327 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-08 13:52:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:23,328 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-08 13:52:23,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-08 13:52:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-08 13:52:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-08 13:52:23,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:23,329 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-08 13:52:23,329 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-08 13:52:23,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:23,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 13:52:24,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:24,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:24,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:24,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:24,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:24,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:24,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:24,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-08 13:52:24,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:24,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 13:52:24,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 13:52:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-08 13:52:25,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 13:52:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 13:52:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:25,462 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-08 13:52:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:25,572 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-08 13:52:25,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 13:52:25,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-08 13:52:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:25,574 INFO L225 Difference]: With dead ends: 97 [2019-01-08 13:52:25,574 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 13:52:25,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 13:52:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-08 13:52:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-08 13:52:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-08 13:52:25,578 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-08 13:52:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:25,578 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-08 13:52:25,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 13:52:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-08 13:52:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-08 13:52:25,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:25,579 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-08 13:52:25,579 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-08 13:52:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:25,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:25,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 13:52:26,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:26,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:26,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:26,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:26,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:26,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:26,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:26,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:26,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:26,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:26,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 13:52:26,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 13:52:27,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:27,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-08 13:52:27,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:27,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-08 13:52:27,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-08 13:52:27,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 13:52:27,832 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-08 13:52:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:27,981 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-08 13:52:27,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-08 13:52:27,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-08 13:52:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:27,983 INFO L225 Difference]: With dead ends: 100 [2019-01-08 13:52:27,983 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 13:52:27,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 13:52:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 13:52:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-08 13:52:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 13:52:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-08 13:52:27,986 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-08 13:52:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:27,986 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-08 13:52:27,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-08 13:52:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-08 13:52:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-08 13:52:27,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:27,987 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-08 13:52:27,987 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:27,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-08 13:52:27,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 13:52:28,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:28,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:28,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:28,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:28,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:28,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:28,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:28,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:28,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 13:52:28,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 13:52:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:30,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-08 13:52:30,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:30,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-08 13:52:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-08 13:52:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 13:52:30,084 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-08 13:52:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:30,217 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-08 13:52:30,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 13:52:30,217 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-08 13:52:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:30,218 INFO L225 Difference]: With dead ends: 103 [2019-01-08 13:52:30,218 INFO L226 Difference]: Without dead ends: 69 [2019-01-08 13:52:30,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 13:52:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-08 13:52:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-08 13:52:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-08 13:52:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-08 13:52:30,221 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-08 13:52:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:30,222 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-08 13:52:30,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-08 13:52:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-08 13:52:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-08 13:52:30,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:30,223 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-08 13:52:30,223 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-08 13:52:30,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:30,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:30,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 13:52:30,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:30,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:30,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:30,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:30,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:30,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:30,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-08 13:52:30,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:30,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 13:52:30,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 13:52:32,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:32,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-08 13:52:32,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:32,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-08 13:52:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-08 13:52:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:32,208 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-08 13:52:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:32,358 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-08 13:52:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 13:52:32,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-08 13:52:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:32,359 INFO L225 Difference]: With dead ends: 106 [2019-01-08 13:52:32,359 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 13:52:32,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 13:52:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-08 13:52:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 13:52:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-08 13:52:32,363 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-08 13:52:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:32,363 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-08 13:52:32,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-08 13:52:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-08 13:52:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-08 13:52:32,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:32,364 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-08 13:52:32,364 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-08 13:52:32,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:32,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:32,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 13:52:32,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:32,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:32,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:32,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:32,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:32,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:32,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:32,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:32,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:32,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:32,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 13:52:32,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 13:52:34,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:34,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-08 13:52:34,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:34,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-08 13:52:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-08 13:52:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 13:52:34,646 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-08 13:52:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:34,822 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-08 13:52:34,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 13:52:34,823 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-08 13:52:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:34,823 INFO L225 Difference]: With dead ends: 109 [2019-01-08 13:52:34,823 INFO L226 Difference]: Without dead ends: 73 [2019-01-08 13:52:34,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 13:52:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-08 13:52:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-08 13:52:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 13:52:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-08 13:52:34,827 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-08 13:52:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:34,827 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-08 13:52:34,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-08 13:52:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-08 13:52:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 13:52:34,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:34,828 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-08 13:52:34,828 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-08 13:52:34,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:34,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:34,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:34,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 13:52:35,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:35,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:35,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:35,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:35,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:35,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:35,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:35,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:35,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 13:52:35,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 13:52:36,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:36,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-08 13:52:36,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:36,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-08 13:52:36,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-08 13:52:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 13:52:36,931 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-08 13:52:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:37,190 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-08 13:52:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 13:52:37,190 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-08 13:52:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:37,191 INFO L225 Difference]: With dead ends: 112 [2019-01-08 13:52:37,191 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 13:52:37,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 13:52:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 13:52:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-08 13:52:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 13:52:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-08 13:52:37,196 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-08 13:52:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:37,196 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-08 13:52:37,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-08 13:52:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-08 13:52:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-08 13:52:37,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:37,197 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-08 13:52:37,197 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-08 13:52:37,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:37,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:37,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:37,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:37,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 13:52:38,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:38,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:38,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:38,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:38,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:38,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:38,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:38,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:38,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-08 13:52:38,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:38,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 13:52:38,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 13:52:40,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:40,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-08 13:52:40,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:40,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 13:52:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 13:52:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:40,191 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-08 13:52:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:40,326 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-08 13:52:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-08 13:52:40,326 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-08 13:52:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:40,327 INFO L225 Difference]: With dead ends: 115 [2019-01-08 13:52:40,327 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 13:52:40,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 13:52:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-08 13:52:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 13:52:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-08 13:52:40,331 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-08 13:52:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:40,331 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-08 13:52:40,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 13:52:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-08 13:52:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-08 13:52:40,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:40,331 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-08 13:52:40,332 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-08 13:52:40,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:40,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:40,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 13:52:41,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:41,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:41,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:41,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:41,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:41,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:41,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:41,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:41,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:41,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:41,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 13:52:41,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 13:52:42,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:42,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-08 13:52:42,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:42,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-08 13:52:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-08 13:52:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 13:52:42,842 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-08 13:52:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:42,988 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-08 13:52:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 13:52:42,988 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-08 13:52:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:42,989 INFO L225 Difference]: With dead ends: 118 [2019-01-08 13:52:42,989 INFO L226 Difference]: Without dead ends: 79 [2019-01-08 13:52:42,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 13:52:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-08 13:52:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-08 13:52:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-08 13:52:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-08 13:52:42,993 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-08 13:52:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:42,993 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-08 13:52:42,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-08 13:52:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-08 13:52:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-08 13:52:42,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:42,994 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-08 13:52:42,994 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-08 13:52:42,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:42,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:42,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 13:52:43,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:43,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:43,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:43,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:43,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:43,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:43,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:43,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:43,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 13:52:43,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 13:52:45,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:45,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-08 13:52:45,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:45,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-08 13:52:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-08 13:52:45,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 13:52:45,776 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-08 13:52:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:45,925 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-08 13:52:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 13:52:45,925 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-08 13:52:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:45,926 INFO L225 Difference]: With dead ends: 121 [2019-01-08 13:52:45,926 INFO L226 Difference]: Without dead ends: 81 [2019-01-08 13:52:45,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 13:52:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-08 13:52:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-08 13:52:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-08 13:52:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-08 13:52:45,930 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-08 13:52:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:45,931 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-08 13:52:45,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-08 13:52:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-08 13:52:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-08 13:52:45,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:45,932 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-08 13:52:45,932 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-08 13:52:45,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:45,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:45,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 13:52:46,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:46,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:46,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:46,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:46,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:46,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:46,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:47,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-08 13:52:47,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:47,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 13:52:47,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 13:52:49,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:49,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-08 13:52:49,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:49,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-08 13:52:49,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-08 13:52:49,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:49,257 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-08 13:52:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:49,465 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-08 13:52:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-08 13:52:49,465 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-08 13:52:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:49,466 INFO L225 Difference]: With dead ends: 124 [2019-01-08 13:52:49,466 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 13:52:49,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 13:52:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-08 13:52:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-08 13:52:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-08 13:52:49,468 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-08 13:52:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:49,469 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-08 13:52:49,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-08 13:52:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-08 13:52:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-08 13:52:49,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:49,470 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-08 13:52:49,470 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-08 13:52:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:49,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:49,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 13:52:50,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:50,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:50,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:50,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:50,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:50,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:50,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:50,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:50,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:50,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 13:52:50,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 13:52:52,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:52,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-08 13:52:52,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:52,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-08 13:52:52,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-08 13:52:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 13:52:52,093 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-08 13:52:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:52,243 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-08 13:52:52,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-08 13:52:52,244 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-08 13:52:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:52,245 INFO L225 Difference]: With dead ends: 127 [2019-01-08 13:52:52,245 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 13:52:52,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 13:52:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 13:52:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-08 13:52:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-08 13:52:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-08 13:52:52,248 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-08 13:52:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:52,248 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-08 13:52:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-08 13:52:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-08 13:52:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-08 13:52:52,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:52,249 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-08 13:52:52,250 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-08 13:52:52,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:52,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:52,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 13:52:53,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:53,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:53,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:53,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:53,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:53,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:53,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:53,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 13:52:53,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 13:52:55,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:55,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-08 13:52:55,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:55,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-08 13:52:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-08 13:52:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 13:52:55,248 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-08 13:52:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:55,416 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-08 13:52:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-08 13:52:55,417 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-08 13:52:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:55,418 INFO L225 Difference]: With dead ends: 130 [2019-01-08 13:52:55,418 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 13:52:55,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 13:52:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 13:52:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-08 13:52:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 13:52:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-08 13:52:55,422 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-08 13:52:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:55,422 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-08 13:52:55,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-08 13:52:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-08 13:52:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 13:52:55,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:55,423 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-08 13:52:55,423 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-08 13:52:55,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:55,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:55,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:55,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:55,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 13:52:56,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:56,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:56,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:56,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:56,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:56,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:56,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:56,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:56,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-08 13:52:56,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:56,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 13:52:56,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 13:52:59,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:59,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-08 13:52:59,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:59,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 13:52:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 13:52:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:59,114 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-08 13:52:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:59,280 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-08 13:52:59,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 13:52:59,280 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-08 13:52:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:59,281 INFO L225 Difference]: With dead ends: 133 [2019-01-08 13:52:59,281 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 13:52:59,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 13:52:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-08 13:52:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-08 13:52:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-08 13:52:59,284 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-08 13:52:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:59,285 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-08 13:52:59,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 13:52:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-08 13:52:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-08 13:52:59,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:59,286 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-08 13:52:59,286 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-08 13:52:59,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:59,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:59,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 13:53:00,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:00,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:00,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:00,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:00,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:00,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:00,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:00,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:00,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:00,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:00,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 13:53:00,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 13:53:02,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:02,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-08 13:53:02,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:02,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-08 13:53:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-08 13:53:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 13:53:02,876 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-08 13:53:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:03,041 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-08 13:53:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-08 13:53:03,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-08 13:53:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:03,042 INFO L225 Difference]: With dead ends: 136 [2019-01-08 13:53:03,043 INFO L226 Difference]: Without dead ends: 91 [2019-01-08 13:53:03,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 13:53:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-08 13:53:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-08 13:53:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-08 13:53:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-08 13:53:03,047 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-08 13:53:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:03,047 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-08 13:53:03,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-08 13:53:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-08 13:53:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-08 13:53:03,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:03,048 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-08 13:53:03,048 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-08 13:53:03,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:03,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:03,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 13:53:04,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:04,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:04,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:04,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:04,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:04,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:04,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:04,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:04,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 13:53:04,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 13:53:07,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:07,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-08 13:53:07,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:07,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-08 13:53:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-08 13:53:07,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 13:53:07,069 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-08 13:53:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:07,357 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-08 13:53:07,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-08 13:53:07,358 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-08 13:53:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:07,359 INFO L225 Difference]: With dead ends: 139 [2019-01-08 13:53:07,359 INFO L226 Difference]: Without dead ends: 93 [2019-01-08 13:53:07,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 13:53:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-08 13:53:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-08 13:53:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 13:53:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-08 13:53:07,363 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-08 13:53:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:07,363 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-08 13:53:07,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-08 13:53:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-08 13:53:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-08 13:53:07,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:07,364 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-08 13:53:07,364 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:07,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-08 13:53:07,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:07,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:07,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 13:53:08,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:08,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:08,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:08,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:08,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:08,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:08,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:08,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:08,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-08 13:53:08,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:08,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 13:53:08,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 13:53:11,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:11,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-08 13:53:11,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:11,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 13:53:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 13:53:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:11,199 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-08 13:53:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:12,200 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-08 13:53:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 13:53:12,201 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-08 13:53:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:12,202 INFO L225 Difference]: With dead ends: 142 [2019-01-08 13:53:12,202 INFO L226 Difference]: Without dead ends: 95 [2019-01-08 13:53:12,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-08 13:53:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-08 13:53:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 13:53:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-08 13:53:12,208 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-08 13:53:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:12,208 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-08 13:53:12,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 13:53:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-08 13:53:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-08 13:53:12,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:12,210 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-08 13:53:12,210 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-08 13:53:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:12,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:12,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 13:53:13,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:13,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:13,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:13,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:13,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:13,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:13,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:13,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:13,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 13:53:13,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 13:53:15,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:15,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-08 13:53:15,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:15,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-08 13:53:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-08 13:53:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:53:15,898 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-08 13:53:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:16,193 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-08 13:53:16,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 13:53:16,201 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-08 13:53:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:16,202 INFO L225 Difference]: With dead ends: 145 [2019-01-08 13:53:16,202 INFO L226 Difference]: Without dead ends: 97 [2019-01-08 13:53:16,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:53:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-08 13:53:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-08 13:53:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 13:53:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-08 13:53:16,206 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-08 13:53:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:16,206 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-08 13:53:16,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-08 13:53:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-08 13:53:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-08 13:53:16,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:16,207 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-08 13:53:16,208 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-08 13:53:16,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:16,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:16,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:16,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:16,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 13:53:17,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:17,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:17,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:17,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:17,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:17,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:17,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:17,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 13:53:17,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 13:53:19,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:19,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-08 13:53:19,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:19,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-08 13:53:19,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-08 13:53:19,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 13:53:19,881 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-08 13:53:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:20,094 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-08 13:53:20,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-08 13:53:20,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-08 13:53:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:20,095 INFO L225 Difference]: With dead ends: 148 [2019-01-08 13:53:20,095 INFO L226 Difference]: Without dead ends: 99 [2019-01-08 13:53:20,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 13:53:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-08 13:53:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-08 13:53:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-08 13:53:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-08 13:53:20,098 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-08 13:53:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:20,099 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-08 13:53:20,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-08 13:53:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-08 13:53:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-08 13:53:20,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:20,100 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-08 13:53:20,100 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-08 13:53:20,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:20,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:20,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 13:53:21,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:21,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:21,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:21,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:21,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:21,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:21,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:21,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:21,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-08 13:53:21,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:21,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 13:53:21,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 13:53:25,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:25,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-08 13:53:25,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:25,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 13:53:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 13:53:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:25,981 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-08 13:53:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:26,163 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-08 13:53:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 13:53:26,163 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-08 13:53:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:26,164 INFO L225 Difference]: With dead ends: 151 [2019-01-08 13:53:26,164 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 13:53:26,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 13:53:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-08 13:53:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 13:53:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-08 13:53:26,168 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-08 13:53:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:26,168 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-08 13:53:26,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 13:53:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-08 13:53:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-08 13:53:26,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:26,169 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-08 13:53:26,170 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:26,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-08 13:53:26,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:26,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:26,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:26,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:26,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 13:53:27,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:27,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:27,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:27,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:27,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:27,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:27,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:27,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:27,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:27,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:27,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 13:53:27,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 13:53:30,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:30,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-08 13:53:30,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:30,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-08 13:53:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-08 13:53:30,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 13:53:30,025 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-08 13:53:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:30,420 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-08 13:53:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-08 13:53:30,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-08 13:53:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:30,421 INFO L225 Difference]: With dead ends: 154 [2019-01-08 13:53:30,421 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 13:53:30,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 13:53:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 13:53:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-08 13:53:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 13:53:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-08 13:53:30,425 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-08 13:53:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:30,425 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-08 13:53:30,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-08 13:53:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-08 13:53:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-08 13:53:30,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:30,426 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-08 13:53:30,426 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-08 13:53:30,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:30,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:30,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 13:53:31,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:31,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:31,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:31,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:31,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:31,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:31,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:31,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:31,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 13:53:31,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 13:53:34,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:34,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-08 13:53:34,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:34,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-08 13:53:34,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-08 13:53:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 13:53:34,581 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-08 13:53:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:34,817 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-08 13:53:34,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 13:53:34,817 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-08 13:53:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:34,818 INFO L225 Difference]: With dead ends: 157 [2019-01-08 13:53:34,818 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 13:53:34,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 13:53:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 13:53:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-08 13:53:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-08 13:53:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-08 13:53:34,822 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-08 13:53:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:34,822 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-08 13:53:34,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-08 13:53:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-08 13:53:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-08 13:53:34,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:34,823 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-08 13:53:34,823 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-08 13:53:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:34,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:34,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 13:53:36,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:36,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:36,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:36,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:36,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:36,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:36,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:36,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:37,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-08 13:53:37,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:37,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 13:53:37,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 13:53:41,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:41,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-08 13:53:41,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:41,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 13:53:41,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 13:53:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:41,399 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-08 13:53:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:42,242 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-08 13:53:42,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-08 13:53:42,242 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-08 13:53:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:42,243 INFO L225 Difference]: With dead ends: 160 [2019-01-08 13:53:42,243 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 13:53:42,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 13:53:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-08 13:53:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-08 13:53:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-08 13:53:42,247 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-08 13:53:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:42,248 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-08 13:53:42,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 13:53:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-08 13:53:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-08 13:53:42,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:42,249 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-08 13:53:42,249 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-08 13:53:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:42,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:42,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 13:53:43,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:43,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:43,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:43,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:43,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:43,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:43,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:43,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:43,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:43,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 13:53:43,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 13:53:46,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:46,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-08 13:53:46,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:46,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-08 13:53:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-08 13:53:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 13:53:46,532 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-08 13:53:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:46,876 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-08 13:53:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 13:53:46,876 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-08 13:53:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:46,877 INFO L225 Difference]: With dead ends: 163 [2019-01-08 13:53:46,877 INFO L226 Difference]: Without dead ends: 109 [2019-01-08 13:53:46,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 13:53:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-08 13:53:46,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-08 13:53:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-08 13:53:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-08 13:53:46,881 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-08 13:53:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:46,881 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-08 13:53:46,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-08 13:53:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-08 13:53:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-08 13:53:46,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:46,882 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-08 13:53:46,883 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-08 13:53:46,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:46,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:46,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 13:53:48,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:48,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:48,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:48,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:48,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:48,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:48,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:48,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:48,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 13:53:48,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 13:53:51,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:51,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-08 13:53:51,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:51,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-08 13:53:51,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-08 13:53:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 13:53:51,858 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-08 13:53:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:52,088 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-08 13:53:52,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 13:53:52,089 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-08 13:53:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:52,090 INFO L225 Difference]: With dead ends: 166 [2019-01-08 13:53:52,090 INFO L226 Difference]: Without dead ends: 111 [2019-01-08 13:53:52,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 13:53:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-08 13:53:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-08 13:53:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-08 13:53:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-08 13:53:52,093 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-08 13:53:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:52,094 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-08 13:53:52,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-08 13:53:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-08 13:53:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-08 13:53:52,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:52,094 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-08 13:53:52,094 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-08 13:53:52,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:52,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:52,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-08 13:53:53,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:53,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:53,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:53,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:53,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:53,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:53,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:53,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:54,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-08 13:53:54,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:54,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-08 13:53:54,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-08 13:53:58,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:58,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-08 13:53:58,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:58,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-08 13:53:58,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-08 13:53:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:58,165 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-08 13:53:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:58,415 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-08 13:53:58,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-08 13:53:58,415 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-08 13:53:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:58,416 INFO L225 Difference]: With dead ends: 169 [2019-01-08 13:53:58,416 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 13:53:58,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 13:53:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-08 13:53:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-08 13:53:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-08 13:53:58,420 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-08 13:53:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:58,420 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-08 13:53:58,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-08 13:53:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-08 13:53:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-08 13:53:58,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:58,421 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-08 13:53:58,421 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-08 13:53:58,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:58,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:58,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-08 13:53:59,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:59,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:59,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:59,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:59,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:59,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:59,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:59,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:59,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:59,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:59,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-08 13:53:59,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-08 13:54:03,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:03,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-08 13:54:03,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:03,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-08 13:54:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-08 13:54:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 13:54:03,390 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-08 13:54:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:03,615 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-08 13:54:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-08 13:54:03,615 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-08 13:54:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:03,616 INFO L225 Difference]: With dead ends: 172 [2019-01-08 13:54:03,617 INFO L226 Difference]: Without dead ends: 115 [2019-01-08 13:54:03,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 13:54:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-08 13:54:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-08 13:54:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-08 13:54:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-08 13:54:03,621 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-08 13:54:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:03,621 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-08 13:54:03,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-08 13:54:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-08 13:54:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-08 13:54:03,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:03,622 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-08 13:54:03,622 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:03,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-08 13:54:03,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:03,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:03,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-08 13:54:04,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:04,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:04,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:04,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:04,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:04,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:04,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:04,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-08 13:54:04,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-08 13:54:09,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:09,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-08 13:54:09,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:09,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-08 13:54:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-08 13:54:09,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:54:09,046 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-08 13:54:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:09,465 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-08 13:54:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 13:54:09,466 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-08 13:54:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:09,467 INFO L225 Difference]: With dead ends: 175 [2019-01-08 13:54:09,467 INFO L226 Difference]: Without dead ends: 117 [2019-01-08 13:54:09,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:54:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-08 13:54:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-08 13:54:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-08 13:54:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-08 13:54:09,470 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-08 13:54:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:09,471 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-08 13:54:09,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-08 13:54:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-08 13:54:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-08 13:54:09,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:09,472 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-08 13:54:09,472 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:09,472 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-08 13:54:09,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:09,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:09,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:09,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:09,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-08 13:54:11,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:11,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:11,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:11,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:11,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:11,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:11,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:11,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:11,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-08 13:54:11,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:11,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-08 13:54:11,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-08 13:54:15,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:15,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-08 13:54:15,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:15,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 13:54:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 13:54:15,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:54:15,838 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-08 13:54:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:16,141 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-08 13:54:16,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 13:54:16,142 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-08 13:54:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:16,142 INFO L225 Difference]: With dead ends: 178 [2019-01-08 13:54:16,142 INFO L226 Difference]: Without dead ends: 119 [2019-01-08 13:54:16,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:54:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-08 13:54:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-08 13:54:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-08 13:54:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-08 13:54:16,146 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-08 13:54:16,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:16,146 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-08 13:54:16,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 13:54:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-08 13:54:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-08 13:54:16,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:16,147 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-08 13:54:16,148 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:16,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-08 13:54:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:16,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:16,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-08 13:54:17,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:17,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:17,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:17,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:17,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:17,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:17,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:17,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:17,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:17,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:17,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-08 13:54:17,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-08 13:54:21,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:21,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-08 13:54:21,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:21,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-08 13:54:21,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-08 13:54:21,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 13:54:21,448 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-08 13:54:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:21,835 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-08 13:54:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 13:54:21,836 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-08 13:54:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:21,836 INFO L225 Difference]: With dead ends: 181 [2019-01-08 13:54:21,836 INFO L226 Difference]: Without dead ends: 121 [2019-01-08 13:54:21,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 13:54:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-08 13:54:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-08 13:54:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-08 13:54:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-08 13:54:21,840 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-08 13:54:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:21,840 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-08 13:54:21,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-08 13:54:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-08 13:54:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-08 13:54:21,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:21,841 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-08 13:54:21,841 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-08 13:54:21,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:21,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:21,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:21,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-08 13:54:23,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:23,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:23,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:23,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:23,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:23,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:23,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:23,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:23,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-08 13:54:23,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-08 13:54:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-08 13:54:27,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:27,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-08 13:54:27,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-08 13:54:27,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 13:54:27,357 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-08 13:54:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:27,691 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-08 13:54:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-08 13:54:27,691 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-08 13:54:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:27,692 INFO L225 Difference]: With dead ends: 184 [2019-01-08 13:54:27,692 INFO L226 Difference]: Without dead ends: 123 [2019-01-08 13:54:27,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 13:54:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-08 13:54:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-08 13:54:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-08 13:54:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-08 13:54:27,695 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-08 13:54:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:27,696 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-08 13:54:27,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-08 13:54:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-08 13:54:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-08 13:54:27,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:27,697 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-08 13:54:27,697 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-08 13:54:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-08 13:54:29,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:29,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:29,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:29,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:29,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:29,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:30,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-08 13:54:30,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:30,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-08 13:54:30,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-08 13:54:34,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:34,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-08 13:54:34,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-08 13:54:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-08 13:54:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:54:34,578 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-08 13:54:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:34,895 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-08 13:54:34,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 13:54:34,895 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-08 13:54:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:34,896 INFO L225 Difference]: With dead ends: 187 [2019-01-08 13:54:34,896 INFO L226 Difference]: Without dead ends: 125 [2019-01-08 13:54:34,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:54:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-08 13:54:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-08 13:54:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-08 13:54:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-08 13:54:34,900 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-08 13:54:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:34,900 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-08 13:54:34,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-08 13:54:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-08 13:54:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-08 13:54:34,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:34,901 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-08 13:54:34,901 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:34,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-08 13:54:34,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:34,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:34,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-08 13:54:36,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:36,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:36,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:36,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:36,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:36,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:36,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:36,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:36,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:36,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:36,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-08 13:54:36,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-08 13:54:40,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:40,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-08 13:54:40,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:40,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-08 13:54:40,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-08 13:54:40,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-08 13:54:40,751 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-08 13:54:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:41,024 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-08 13:54:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 13:54:41,024 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-08 13:54:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:41,025 INFO L225 Difference]: With dead ends: 190 [2019-01-08 13:54:41,026 INFO L226 Difference]: Without dead ends: 127 [2019-01-08 13:54:41,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-08 13:54:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-08 13:54:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-08 13:54:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-08 13:54:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-08 13:54:41,029 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-08 13:54:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:41,029 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-08 13:54:41,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-08 13:54:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-08 13:54:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-08 13:54:41,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:41,030 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-08 13:54:41,030 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:41,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-08 13:54:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:41,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:41,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-08 13:54:42,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:42,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:42,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:42,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:42,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:42,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:42,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:42,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:42,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-08 13:54:42,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-08 13:54:47,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:47,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-08 13:54:47,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:47,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-08 13:54:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-08 13:54:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 13:54:47,125 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-08 13:54:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:47,545 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-08 13:54:47,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 13:54:47,545 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-08 13:54:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:47,546 INFO L225 Difference]: With dead ends: 193 [2019-01-08 13:54:47,546 INFO L226 Difference]: Without dead ends: 129 [2019-01-08 13:54:47,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 13:54:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-08 13:54:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-08 13:54:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-08 13:54:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-08 13:54:47,550 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-08 13:54:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:47,550 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-08 13:54:47,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-08 13:54:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-08 13:54:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-08 13:54:47,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:47,551 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-08 13:54:47,551 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-08 13:54:47,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:47,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:47,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-08 13:54:49,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:49,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:49,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:49,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:49,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:49,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:49,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:49,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:50,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-08 13:54:50,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:50,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-08 13:54:50,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-08 13:54:54,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:54,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-08 13:54:54,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:54,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 13:54:54,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 13:54:54,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:54,746 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-08 13:54:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:55,125 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-08 13:54:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-08 13:54:55,125 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-08 13:54:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:55,126 INFO L225 Difference]: With dead ends: 196 [2019-01-08 13:54:55,126 INFO L226 Difference]: Without dead ends: 131 [2019-01-08 13:54:55,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-08 13:54:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-08 13:54:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-08 13:54:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-08 13:54:55,129 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-08 13:54:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:55,129 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-08 13:54:55,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 13:54:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-08 13:54:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-08 13:54:55,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:55,130 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-08 13:54:55,130 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-08 13:54:55,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:55,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:55,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:55,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:55,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-08 13:54:56,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:56,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:56,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:56,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:56,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:56,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:56,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:56,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:56,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:56,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:56,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-08 13:54:56,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-08 13:55:01,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:01,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-08 13:55:01,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:01,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-08 13:55:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-08 13:55:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 13:55:01,402 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-08 13:55:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:01,785 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-08 13:55:01,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-08 13:55:01,785 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-08 13:55:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:01,786 INFO L225 Difference]: With dead ends: 199 [2019-01-08 13:55:01,786 INFO L226 Difference]: Without dead ends: 133 [2019-01-08 13:55:01,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 13:55:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-08 13:55:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-08 13:55:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-08 13:55:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-08 13:55:01,790 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-08 13:55:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:01,791 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-08 13:55:01,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-08 13:55:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-08 13:55:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-08 13:55:01,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:01,792 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-08 13:55:01,792 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-08 13:55:01,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:01,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:01,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-08 13:55:03,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:03,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:03,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:03,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:03,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:03,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:03,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:03,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:03,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-08 13:55:03,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-08 13:55:09,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:09,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-08 13:55:09,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:09,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-08 13:55:09,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-08 13:55:09,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 13:55:09,075 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-08 13:55:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:09,500 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-08 13:55:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 13:55:09,500 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-08 13:55:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:09,501 INFO L225 Difference]: With dead ends: 202 [2019-01-08 13:55:09,501 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 13:55:09,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 13:55:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 13:55:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-08 13:55:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-08 13:55:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-08 13:55:09,505 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-08 13:55:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:09,506 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-08 13:55:09,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-08 13:55:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-08 13:55:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-08 13:55:09,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:09,507 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-08 13:55:09,507 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-08 13:55:09,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:09,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:09,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:09,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:09,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-08 13:55:11,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:11,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:11,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:11,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:11,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:11,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:11,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:11,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:14,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-08 13:55:14,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:14,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-08 13:55:14,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-08 13:55:19,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:19,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-08 13:55:19,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:19,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-08 13:55:19,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-08 13:55:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:55:19,742 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-08 13:55:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:20,105 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-08 13:55:20,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 13:55:20,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-08 13:55:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:20,106 INFO L225 Difference]: With dead ends: 205 [2019-01-08 13:55:20,106 INFO L226 Difference]: Without dead ends: 137 [2019-01-08 13:55:20,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:55:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-08 13:55:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-08 13:55:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-08 13:55:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-08 13:55:20,111 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-08 13:55:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:20,111 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-08 13:55:20,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-08 13:55:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-08 13:55:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-08 13:55:20,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:20,112 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-08 13:55:20,112 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-08 13:55:20,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:20,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:20,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-08 13:55:22,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:22,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:22,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:22,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:22,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:22,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:22,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:22,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:22,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:22,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-08 13:55:22,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-08 13:55:27,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:27,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-08 13:55:27,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:27,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-08 13:55:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-08 13:55:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 13:55:27,762 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-08 13:55:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:28,239 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-08 13:55:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-08 13:55:28,239 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-08 13:55:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:28,240 INFO L225 Difference]: With dead ends: 208 [2019-01-08 13:55:28,240 INFO L226 Difference]: Without dead ends: 139 [2019-01-08 13:55:28,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 13:55:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-08 13:55:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-08 13:55:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-08 13:55:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-08 13:55:28,243 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-08 13:55:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:28,244 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-08 13:55:28,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-08 13:55:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-08 13:55:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-08 13:55:28,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:28,244 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-08 13:55:28,244 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-08 13:55:28,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:28,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:28,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-08 13:55:29,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:29,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:29,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:29,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:29,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:29,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:29,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:29,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:30,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-08 13:55:30,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-08 13:55:35,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:35,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-08 13:55:35,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:35,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-08 13:55:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-08 13:55:35,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 13:55:35,491 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-08 13:55:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:35,944 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-08 13:55:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-08 13:55:35,944 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-08 13:55:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:35,945 INFO L225 Difference]: With dead ends: 211 [2019-01-08 13:55:35,945 INFO L226 Difference]: Without dead ends: 141 [2019-01-08 13:55:35,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 13:55:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-08 13:55:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-08 13:55:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-08 13:55:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-08 13:55:35,949 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-08 13:55:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:35,949 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-08 13:55:35,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-08 13:55:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-08 13:55:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-08 13:55:35,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:35,950 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-08 13:55:35,950 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-08 13:55:35,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:35,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:35,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:35,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-08 13:55:37,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:37,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:37,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:37,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:37,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:37,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:37,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:41,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-08 13:55:41,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:41,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-08 13:55:41,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-08 13:55:46,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:46,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-08 13:55:46,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:46,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 13:55:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 13:55:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:55:46,883 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-08 13:55:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:47,354 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-08 13:55:47,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-08 13:55:47,354 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-08 13:55:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:47,355 INFO L225 Difference]: With dead ends: 214 [2019-01-08 13:55:47,355 INFO L226 Difference]: Without dead ends: 143 [2019-01-08 13:55:47,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:55:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-08 13:55:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-08 13:55:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-08 13:55:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-08 13:55:47,358 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-08 13:55:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:47,358 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-08 13:55:47,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 13:55:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-08 13:55:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-08 13:55:47,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:47,359 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-08 13:55:47,359 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:47,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:47,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-08 13:55:47,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:47,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:47,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-08 13:55:49,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:49,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:49,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:49,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:49,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:49,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:49,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:49,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:49,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:49,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:49,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-08 13:55:49,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-08 13:55:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:55,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-08 13:55:55,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:55,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-08 13:55:55,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-08 13:55:55,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 13:55:55,021 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-08 13:55:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:55,495 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-08 13:55:55,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 13:55:55,495 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-08 13:55:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:55,496 INFO L225 Difference]: With dead ends: 217 [2019-01-08 13:55:55,496 INFO L226 Difference]: Without dead ends: 145 [2019-01-08 13:55:55,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 13:55:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-08 13:55:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-08 13:55:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-08 13:55:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-08 13:55:55,500 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-08 13:55:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:55,500 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-08 13:55:55,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-08 13:55:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-08 13:55:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-08 13:55:55,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:55,501 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-08 13:55:55,501 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-08 13:55:55,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:55,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:55,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-08 13:55:57,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:57,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:57,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:57,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:57,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:57,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:57,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:57,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:57,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-08 13:55:57,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-08 13:56:03,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:03,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-08 13:56:03,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:03,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-08 13:56:03,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-08 13:56:03,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 13:56:03,201 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-08 13:56:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:03,618 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-08 13:56:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-08 13:56:03,619 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-08 13:56:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:03,620 INFO L225 Difference]: With dead ends: 220 [2019-01-08 13:56:03,620 INFO L226 Difference]: Without dead ends: 147 [2019-01-08 13:56:03,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 13:56:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-08 13:56:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-08 13:56:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-08 13:56:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-08 13:56:03,625 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-08 13:56:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:03,626 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-08 13:56:03,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-08 13:56:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-08 13:56:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-08 13:56:03,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:03,627 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-08 13:56:03,627 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-08 13:56:03,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:03,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:03,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-08 13:56:05,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:05,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:05,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:05,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:05,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:05,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:05,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:05,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:08,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-08 13:56:08,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:08,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-08 13:56:08,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-08 13:56:14,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-08 13:56:14,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:14,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 13:56:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 13:56:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:56:14,908 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-08 13:56:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:15,452 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-08 13:56:15,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-08 13:56:15,452 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-08 13:56:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:15,453 INFO L225 Difference]: With dead ends: 223 [2019-01-08 13:56:15,453 INFO L226 Difference]: Without dead ends: 149 [2019-01-08 13:56:15,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:56:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-08 13:56:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-08 13:56:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-08 13:56:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-08 13:56:15,457 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-08 13:56:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:15,457 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-08 13:56:15,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 13:56:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-08 13:56:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-08 13:56:15,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:15,458 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-08 13:56:15,459 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:15,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-08 13:56:15,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:15,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:15,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:15,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-08 13:56:17,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:17,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:17,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:17,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:17,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:17,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:17,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:17,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:17,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:17,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-08 13:56:17,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-08 13:56:23,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:23,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-08 13:56:23,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:23,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-08 13:56:23,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-08 13:56:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 13:56:23,763 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-08 13:56:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:24,266 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-08 13:56:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 13:56:24,266 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-08 13:56:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:24,267 INFO L225 Difference]: With dead ends: 226 [2019-01-08 13:56:24,267 INFO L226 Difference]: Without dead ends: 151 [2019-01-08 13:56:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 13:56:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-08 13:56:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-08 13:56:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-08 13:56:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-08 13:56:24,271 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-08 13:56:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:24,272 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-08 13:56:24,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-08 13:56:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-08 13:56:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-08 13:56:24,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:24,273 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-08 13:56:24,273 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:24,273 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-08 13:56:24,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:24,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:24,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-08 13:56:26,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:26,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:26,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:26,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:26,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:26,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:26,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:26,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:26,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-08 13:56:26,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-08 13:56:32,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:32,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-08 13:56:32,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:32,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-08 13:56:32,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-08 13:56:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 13:56:32,962 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-08 13:56:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:33,436 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-08 13:56:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 13:56:33,437 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-08 13:56:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:33,438 INFO L225 Difference]: With dead ends: 229 [2019-01-08 13:56:33,438 INFO L226 Difference]: Without dead ends: 153 [2019-01-08 13:56:33,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 13:56:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-08 13:56:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-08 13:56:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-08 13:56:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-08 13:56:33,442 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-08 13:56:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:33,442 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-08 13:56:33,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-08 13:56:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-08 13:56:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-08 13:56:33,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:33,443 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-08 13:56:33,443 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:33,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-08 13:56:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:33,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:33,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:33,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:33,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-08 13:56:35,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:35,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:35,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:35,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:35,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:35,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:35,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:35,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:38,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-08 13:56:38,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:38,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-08 13:56:38,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-08 13:56:44,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:44,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-08 13:56:44,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:44,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 13:56:44,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 13:56:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:56:44,610 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-08 13:56:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:45,173 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-08 13:56:45,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-08 13:56:45,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-08 13:56:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:45,174 INFO L225 Difference]: With dead ends: 232 [2019-01-08 13:56:45,174 INFO L226 Difference]: Without dead ends: 155 [2019-01-08 13:56:45,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:56:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-08 13:56:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-08 13:56:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-08 13:56:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-08 13:56:45,178 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-08 13:56:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:45,178 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-08 13:56:45,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 13:56:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-08 13:56:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-08 13:56:45,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:45,179 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-08 13:56:45,179 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-08 13:56:45,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:45,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:45,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-08 13:56:47,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:47,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:47,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:47,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:47,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:47,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:47,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:47,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:47,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:47,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:47,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-08 13:56:47,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-08 13:56:53,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:53,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-08 13:56:53,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:53,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-08 13:56:53,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-08 13:56:53,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:56:53,764 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-08 13:56:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:54,427 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-08 13:56:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-08 13:56:54,427 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-08 13:56:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:54,428 INFO L225 Difference]: With dead ends: 235 [2019-01-08 13:56:54,428 INFO L226 Difference]: Without dead ends: 157 [2019-01-08 13:56:54,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:56:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-08 13:56:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-08 13:56:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-08 13:56:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-08 13:56:54,432 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-08 13:56:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:54,432 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-08 13:56:54,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-08 13:56:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-08 13:56:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-08 13:56:54,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:54,433 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-08 13:56:54,433 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-08 13:56:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:54,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:54,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-08 13:56:56,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:56,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:56,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:56,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:56,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:56,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:56,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:57,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-08 13:56:57,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-08 13:57:03,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:03,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-08 13:57:03,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:03,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-08 13:57:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-08 13:57:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:57:03,694 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-08 13:57:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:04,238 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-08 13:57:04,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-08 13:57:04,239 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-08 13:57:04,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:04,240 INFO L225 Difference]: With dead ends: 238 [2019-01-08 13:57:04,240 INFO L226 Difference]: Without dead ends: 159 [2019-01-08 13:57:04,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:57:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-08 13:57:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-08 13:57:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-08 13:57:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-08 13:57:04,245 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-08 13:57:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:04,245 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-08 13:57:04,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-08 13:57:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-08 13:57:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-08 13:57:04,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:04,246 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-08 13:57:04,246 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-08 13:57:04,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:04,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:04,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-08 13:57:06,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:06,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:06,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:06,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:06,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:06,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:06,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:06,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:11,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-08 13:57:11,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:11,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-08 13:57:11,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-08 13:57:18,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:18,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-08 13:57:18,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:18,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 13:57:18,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 13:57:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:57:18,238 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-08 13:57:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:18,900 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-08 13:57:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-08 13:57:18,900 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-08 13:57:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:18,901 INFO L225 Difference]: With dead ends: 241 [2019-01-08 13:57:18,901 INFO L226 Difference]: Without dead ends: 161 [2019-01-08 13:57:18,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:57:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-08 13:57:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-08 13:57:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-08 13:57:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-08 13:57:18,906 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-08 13:57:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:18,906 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-08 13:57:18,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 13:57:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-08 13:57:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-08 13:57:18,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:18,907 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-08 13:57:18,908 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-08 13:57:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:18,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:18,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-08 13:57:21,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:21,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:21,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:21,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:21,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:21,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:21,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:21,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:21,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:21,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:21,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-08 13:57:21,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-08 13:57:28,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:28,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-08 13:57:28,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:28,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-08 13:57:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-08 13:57:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:57:28,532 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-08 13:57:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:29,290 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-08 13:57:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-08 13:57:29,291 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-08 13:57:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:29,291 INFO L225 Difference]: With dead ends: 244 [2019-01-08 13:57:29,291 INFO L226 Difference]: Without dead ends: 163 [2019-01-08 13:57:29,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:57:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-08 13:57:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-08 13:57:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-08 13:57:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-08 13:57:29,296 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-08 13:57:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:29,297 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-08 13:57:29,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-08 13:57:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-08 13:57:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-08 13:57:29,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:29,298 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-08 13:57:29,298 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:29,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:29,298 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-08 13:57:29,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:29,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:29,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-08 13:57:32,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:32,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:32,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:32,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:32,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:32,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:32,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:32,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:32,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-08 13:57:32,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-08 13:57:39,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:39,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-08 13:57:39,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:39,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-08 13:57:39,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-08 13:57:39,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:57:39,299 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-08 13:57:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:40,055 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-08 13:57:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-08 13:57:40,055 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-08 13:57:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:40,056 INFO L225 Difference]: With dead ends: 247 [2019-01-08 13:57:40,056 INFO L226 Difference]: Without dead ends: 165 [2019-01-08 13:57:40,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:57:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-08 13:57:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-08 13:57:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-08 13:57:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-08 13:57:40,060 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-08 13:57:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:40,060 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-08 13:57:40,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-08 13:57:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-08 13:57:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-08 13:57:40,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:40,061 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-08 13:57:40,061 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:40,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-08 13:57:40,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:40,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:40,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-08 13:57:42,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:42,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:42,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:42,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:42,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:42,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:42,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:42,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:46,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-08 13:57:46,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:46,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-08 13:57:46,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-08 13:57:56,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:56,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-08 13:57:56,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:56,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-08 13:57:56,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-08 13:57:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:56,132 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-08 13:57:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:56,864 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-08 13:57:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 13:57:56,865 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-08 13:57:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:56,865 INFO L225 Difference]: With dead ends: 250 [2019-01-08 13:57:56,865 INFO L226 Difference]: Without dead ends: 167 [2019-01-08 13:57:56,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-08 13:57:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-08 13:57:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-08 13:57:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-08 13:57:56,869 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-08 13:57:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:56,869 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-08 13:57:56,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-08 13:57:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-08 13:57:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-08 13:57:56,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:56,870 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-08 13:57:56,870 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-08 13:57:56,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:56,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:56,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:56,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:56,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-08 13:57:59,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:59,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:59,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:59,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:59,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:59,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:59,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:59,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:59,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:59,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:59,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-08 13:57:59,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-08 13:58:07,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:07,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-08 13:58:07,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:07,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-08 13:58:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-08 13:58:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:58:07,496 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-08 13:58:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:08,113 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-08 13:58:08,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-08 13:58:08,113 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-08 13:58:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:08,114 INFO L225 Difference]: With dead ends: 253 [2019-01-08 13:58:08,114 INFO L226 Difference]: Without dead ends: 169 [2019-01-08 13:58:08,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:58:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-08 13:58:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-08 13:58:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-08 13:58:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-08 13:58:08,118 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-08 13:58:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:08,118 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-08 13:58:08,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-08 13:58:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-08 13:58:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-08 13:58:08,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:08,119 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-08 13:58:08,119 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-08 13:58:08,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:08,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:08,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:08,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:08,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-08 13:58:10,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:10,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:10,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:10,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:10,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:10,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:10,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:10,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:10,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-08 13:58:10,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-08 13:58:18,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:18,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-08 13:58:18,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:18,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-08 13:58:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-08 13:58:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:58:18,508 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-08 13:58:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:19,314 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-08 13:58:19,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-08 13:58:19,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-08 13:58:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:19,315 INFO L225 Difference]: With dead ends: 256 [2019-01-08 13:58:19,315 INFO L226 Difference]: Without dead ends: 171 [2019-01-08 13:58:19,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:58:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-08 13:58:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-08 13:58:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-08 13:58:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-08 13:58:19,318 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-08 13:58:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:19,319 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-08 13:58:19,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-08 13:58:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-08 13:58:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-08 13:58:19,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:19,319 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-08 13:58:19,320 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-08 13:58:19,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:19,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:19,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-08 13:58:21,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:21,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:21,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:21,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:21,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:21,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:21,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:21,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:31,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-08 13:58:31,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:31,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-08 13:58:31,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-08 13:58:39,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:39,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-08 13:58:39,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:39,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 13:58:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 13:58:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:58:39,748 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-08 13:58:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:40,639 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-08 13:58:40,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 13:58:40,639 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-08 13:58:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:40,640 INFO L225 Difference]: With dead ends: 259 [2019-01-08 13:58:40,640 INFO L226 Difference]: Without dead ends: 173 [2019-01-08 13:58:40,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:58:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-08 13:58:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-08 13:58:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-08 13:58:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-08 13:58:40,644 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-08 13:58:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:40,644 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-08 13:58:40,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 13:58:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-08 13:58:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-08 13:58:40,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:40,645 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-08 13:58:40,645 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-08 13:58:40,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:40,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:40,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-08 13:58:43,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:43,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:43,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:43,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:43,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:43,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:43,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:43,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:43,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:43,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:43,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-08 13:58:43,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-08 13:58:51,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-08 13:58:51,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:51,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-08 13:58:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-08 13:58:51,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:58:51,503 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-08 13:58:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:52,409 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-08 13:58:52,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-08 13:58:52,409 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-08 13:58:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:52,410 INFO L225 Difference]: With dead ends: 262 [2019-01-08 13:58:52,410 INFO L226 Difference]: Without dead ends: 175 [2019-01-08 13:58:52,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:58:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-08 13:58:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-08 13:58:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-08 13:58:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-08 13:58:52,415 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-08 13:58:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:52,415 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-08 13:58:52,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-08 13:58:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-08 13:58:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-08 13:58:52,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:52,416 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-08 13:58:52,416 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-08 13:58:52,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:52,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:52,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:52,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-08 13:58:55,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:55,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:55,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:55,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:55,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:55,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:55,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:55,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:55,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-08 13:58:55,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-08 13:59:04,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:04,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-08 13:59:04,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:04,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-08 13:59:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-08 13:59:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:59:04,008 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-08 13:59:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:04,897 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-08 13:59:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-08 13:59:04,897 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-08 13:59:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:04,898 INFO L225 Difference]: With dead ends: 265 [2019-01-08 13:59:04,898 INFO L226 Difference]: Without dead ends: 177 [2019-01-08 13:59:04,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:59:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-08 13:59:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-08 13:59:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-08 13:59:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-08 13:59:04,902 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-08 13:59:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:04,903 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-08 13:59:04,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-08 13:59:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-08 13:59:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-08 13:59:04,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:04,904 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-08 13:59:04,904 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:04,904 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-08 13:59:04,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:04,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:04,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-08 13:59:07,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:07,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:07,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:07,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:07,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:07,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:07,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:59:07,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:59:17,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-08 13:59:17,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:18,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-08 13:59:18,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-08 13:59:26,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:26,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-08 13:59:26,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:26,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 13:59:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 13:59:26,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:59:26,843 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-08 13:59:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:27,612 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-08 13:59:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-08 13:59:27,612 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-08 13:59:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:27,613 INFO L225 Difference]: With dead ends: 268 [2019-01-08 13:59:27,613 INFO L226 Difference]: Without dead ends: 179 [2019-01-08 13:59:27,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:59:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-08 13:59:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-08 13:59:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-08 13:59:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-08 13:59:27,617 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-08 13:59:27,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:27,617 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-08 13:59:27,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 13:59:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-08 13:59:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-08 13:59:27,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:27,618 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-08 13:59:27,618 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-08 13:59:27,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:27,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:27,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:27,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:27,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-08 13:59:30,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:30,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:30,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:30,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:30,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:30,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:30,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:59:30,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:59:30,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:59:30,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:30,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-08 13:59:30,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-08 13:59:39,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:39,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-08 13:59:39,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:39,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-08 13:59:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-08 13:59:39,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 13:59:39,710 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-08 13:59:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:40,711 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-08 13:59:40,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-08 13:59:40,711 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-08 13:59:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:40,712 INFO L225 Difference]: With dead ends: 271 [2019-01-08 13:59:40,712 INFO L226 Difference]: Without dead ends: 181 [2019-01-08 13:59:40,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 13:59:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-08 13:59:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-08 13:59:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-08 13:59:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-08 13:59:40,717 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-08 13:59:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:40,717 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-08 13:59:40,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-08 13:59:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-08 13:59:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-08 13:59:40,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:40,718 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-08 13:59:40,718 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-08 13:59:40,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:40,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:40,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-08 13:59:43,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:43,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:43,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:43,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:43,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:43,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:43,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:43,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:43,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-08 13:59:43,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-08 13:59:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-08 13:59:52,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:52,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-08 13:59:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-08 13:59:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 13:59:52,556 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-08 13:59:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:53,358 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-08 13:59:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-08 13:59:53,358 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-08 13:59:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:53,359 INFO L225 Difference]: With dead ends: 274 [2019-01-08 13:59:53,359 INFO L226 Difference]: Without dead ends: 183 [2019-01-08 13:59:53,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 13:59:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-08 13:59:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-08 13:59:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-08 13:59:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-08 13:59:53,363 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-08 13:59:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:53,363 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-08 13:59:53,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-08 13:59:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-08 13:59:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-08 13:59:53,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:53,364 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-08 13:59:53,364 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-08 13:59:53,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:53,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:53,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-08 13:59:56,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:56,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:56,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:56,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:56,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:56,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:56,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:59:56,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:01,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-08 14:00:01,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:02,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-08 14:00:02,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-08 14:00:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-08 14:00:11,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:11,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 14:00:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 14:00:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 14:00:11,178 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-08 14:00:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:11,975 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-08 14:00:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-08 14:00:11,976 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-08 14:00:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:11,976 INFO L225 Difference]: With dead ends: 277 [2019-01-08 14:00:11,977 INFO L226 Difference]: Without dead ends: 185 [2019-01-08 14:00:11,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 14:00:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-08 14:00:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-08 14:00:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-08 14:00:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-08 14:00:11,980 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-08 14:00:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:11,981 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-08 14:00:11,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 14:00:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-08 14:00:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-08 14:00:11,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:11,982 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-08 14:00:11,982 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-08 14:00:11,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:11,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:11,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:11,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:11,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-08 14:00:15,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:15,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:15,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:15,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:15,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:15,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:15,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:00:15,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:00:15,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:00:15,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:15,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-08 14:00:15,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-08 14:00:24,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:24,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-08 14:00:24,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:24,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-08 14:00:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-08 14:00:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:00:24,489 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-08 14:00:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:25,280 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-08 14:00:25,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-08 14:00:25,281 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-08 14:00:25,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:25,281 INFO L225 Difference]: With dead ends: 280 [2019-01-08 14:00:25,282 INFO L226 Difference]: Without dead ends: 187 [2019-01-08 14:00:25,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:00:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-08 14:00:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-08 14:00:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-08 14:00:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-08 14:00:25,286 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-08 14:00:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:25,286 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-08 14:00:25,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-08 14:00:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-08 14:00:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-08 14:00:25,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:25,287 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-08 14:00:25,288 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:25,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-08 14:00:25,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:25,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:25,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-08 14:00:28,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:28,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:28,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:28,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:28,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:28,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:28,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:28,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:00:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:28,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-08 14:00:28,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-08 14:00:38,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:38,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-08 14:00:38,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:38,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-08 14:00:38,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-08 14:00:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 14:00:38,149 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-08 14:00:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:39,301 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-08 14:00:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-08 14:00:39,301 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-08 14:00:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:39,302 INFO L225 Difference]: With dead ends: 283 [2019-01-08 14:00:39,302 INFO L226 Difference]: Without dead ends: 189 [2019-01-08 14:00:39,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 14:00:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-08 14:00:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-08 14:00:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-08 14:00:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-08 14:00:39,307 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-08 14:00:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:39,307 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-08 14:00:39,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-08 14:00:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-08 14:00:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-08 14:00:39,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:39,308 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-08 14:00:39,308 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-08 14:00:39,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:39,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:39,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:39,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:39,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-08 14:00:42,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:42,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:42,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:42,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:42,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:42,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:42,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:48,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-08 14:00:48,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:48,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-08 14:00:48,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-08 14:00:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:58,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-08 14:00:58,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:58,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-08 14:00:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-08 14:00:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 14:00:58,482 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-08 14:00:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:59,448 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-08 14:00:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-08 14:00:59,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-08 14:00:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:59,449 INFO L225 Difference]: With dead ends: 286 [2019-01-08 14:00:59,449 INFO L226 Difference]: Without dead ends: 191 [2019-01-08 14:00:59,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 14:00:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-08 14:00:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-08 14:00:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-08 14:00:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-08 14:00:59,454 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-08 14:00:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:59,454 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-08 14:00:59,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-08 14:00:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-08 14:00:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-08 14:00:59,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:59,455 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-08 14:00:59,455 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:59,456 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-08 14:00:59,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:59,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:59,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-08 14:01:02,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:02,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:02,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:02,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:02,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:02,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:02,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:02,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:02,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:02,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:02,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-08 14:01:03,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-08 14:01:12,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:12,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-08 14:01:12,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:12,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-08 14:01:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-08 14:01:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 14:01:12,996 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-08 14:01:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:14,198 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-08 14:01:14,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-08 14:01:14,199 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-08 14:01:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:14,199 INFO L225 Difference]: With dead ends: 289 [2019-01-08 14:01:14,200 INFO L226 Difference]: Without dead ends: 193 [2019-01-08 14:01:14,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 14:01:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-08 14:01:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-08 14:01:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-08 14:01:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-08 14:01:14,203 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-08 14:01:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:14,204 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-08 14:01:14,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-08 14:01:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-08 14:01:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-08 14:01:14,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:14,205 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-08 14:01:14,205 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:14,205 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-08 14:01:14,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:14,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:14,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-08 14:01:17,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:17,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:17,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:17,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:17,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:17,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:17,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:17,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:17,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-08 14:01:17,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-08 14:01:27,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:27,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-08 14:01:27,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:27,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-08 14:01:27,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-08 14:01:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:01:27,953 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-08 14:01:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:29,170 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-08 14:01:29,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-08 14:01:29,170 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-08 14:01:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:29,171 INFO L225 Difference]: With dead ends: 292 [2019-01-08 14:01:29,171 INFO L226 Difference]: Without dead ends: 195 [2019-01-08 14:01:29,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:01:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-08 14:01:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-08 14:01:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-08 14:01:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-08 14:01:29,175 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-08 14:01:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:29,175 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-08 14:01:29,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-08 14:01:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-08 14:01:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-08 14:01:29,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:29,176 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-08 14:01:29,176 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:29,176 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-08 14:01:29,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:29,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:29,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-08 14:01:32,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:32,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:32,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:32,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:32,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:32,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:01:32,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:01:39,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-08 14:01:39,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:39,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-08 14:01:39,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-08 14:01:49,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:49,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-08 14:01:49,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:49,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-08 14:01:49,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-08 14:01:49,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:01:49,848 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-08 14:01:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:51,260 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-08 14:01:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-08 14:01:51,260 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-08 14:01:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:51,261 INFO L225 Difference]: With dead ends: 295 [2019-01-08 14:01:51,261 INFO L226 Difference]: Without dead ends: 197 [2019-01-08 14:01:51,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:01:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-08 14:01:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-08 14:01:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-08 14:01:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-08 14:01:51,265 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-08 14:01:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:51,265 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-08 14:01:51,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-08 14:01:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-08 14:01:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-08 14:01:51,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:51,267 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-08 14:01:51,267 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:51,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-08 14:01:51,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:51,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:51,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:51,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:51,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-08 14:01:55,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:55,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:55,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:55,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:55,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:55,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:55,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:55,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:55,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:55,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:55,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-08 14:01:55,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-08 14:02:05,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:05,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-08 14:02:05,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:05,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-08 14:02:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-08 14:02:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 14:02:05,890 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-08 14:02:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:07,370 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-08 14:02:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-08 14:02:07,371 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-08 14:02:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:07,371 INFO L225 Difference]: With dead ends: 298 [2019-01-08 14:02:07,372 INFO L226 Difference]: Without dead ends: 199 [2019-01-08 14:02:07,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 14:02:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-08 14:02:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-08 14:02:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-08 14:02:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-08 14:02:07,376 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-08 14:02:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:07,376 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-08 14:02:07,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-08 14:02:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-08 14:02:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-08 14:02:07,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:07,377 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-08 14:02:07,377 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-08 14:02:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:07,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:07,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-08 14:02:10,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:10,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:10,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:10,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:10,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:10,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:10,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:10,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:11,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-08 14:02:11,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-08 14:02:21,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:21,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-08 14:02:21,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:21,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-08 14:02:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-08 14:02:21,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-08 14:02:21,719 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-08 14:02:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:22,831 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-08 14:02:22,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-08 14:02:22,831 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-08 14:02:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:22,832 INFO L225 Difference]: With dead ends: 301 [2019-01-08 14:02:22,832 INFO L226 Difference]: Without dead ends: 201 [2019-01-08 14:02:22,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-08 14:02:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-08 14:02:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-08 14:02:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-08 14:02:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-08 14:02:22,836 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-08 14:02:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:22,836 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-08 14:02:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-08 14:02:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-08 14:02:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-08 14:02:22,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:22,837 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-08 14:02:22,837 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-08 14:02:22,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:22,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-08 14:02:26,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:26,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:26,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:26,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:26,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:26,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:26,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:02:26,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:02:42,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-08 14:02:42,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:42,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-08 14:02:42,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-08 14:02:53,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:53,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-08 14:02:53,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:53,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-08 14:02:53,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-08 14:02:53,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-08 14:02:53,980 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-08 14:02:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:55,487 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-08 14:02:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-08 14:02:55,487 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-08 14:02:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:55,488 INFO L225 Difference]: With dead ends: 304 [2019-01-08 14:02:55,488 INFO L226 Difference]: Without dead ends: 203 [2019-01-08 14:02:55,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-08 14:02:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-08 14:02:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-08 14:02:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-08 14:02:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-08 14:02:55,492 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-08 14:02:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:55,492 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-08 14:02:55,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-08 14:02:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-08 14:02:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-08 14:02:55,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:55,493 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-08 14:02:55,493 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-08 14:02:55,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:55,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:55,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-08 14:02:59,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:59,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:59,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:59,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:59,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:59,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:59,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:02:59,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:02:59,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:02:59,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:59,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-08 14:02:59,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-08 14:03:10,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:10,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-08 14:03:10,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:10,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-08 14:03:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-08 14:03:10,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-08 14:03:10,820 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-08 14:03:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:12,392 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-08 14:03:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-08 14:03:12,393 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-08 14:03:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:12,394 INFO L225 Difference]: With dead ends: 307 [2019-01-08 14:03:12,394 INFO L226 Difference]: Without dead ends: 205 [2019-01-08 14:03:12,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-08 14:03:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-08 14:03:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-08 14:03:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-08 14:03:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-08 14:03:12,397 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-08 14:03:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:12,398 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-08 14:03:12,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-08 14:03:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-08 14:03:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-08 14:03:12,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:12,399 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-08 14:03:12,399 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-08 14:03:12,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:12,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:12,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-08 14:03:16,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:16,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:16,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:16,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:16,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:16,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:16,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:16,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:16,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-08 14:03:16,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-08 14:03:27,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:27,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-08 14:03:27,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:27,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-08 14:03:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-08 14:03:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-08 14:03:27,888 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-08 14:03:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:29,459 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-08 14:03:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-08 14:03:29,460 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-08 14:03:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:29,466 INFO L225 Difference]: With dead ends: 310 [2019-01-08 14:03:29,466 INFO L226 Difference]: Without dead ends: 207 [2019-01-08 14:03:29,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-08 14:03:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-08 14:03:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-08 14:03:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-08 14:03:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-08 14:03:29,473 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-08 14:03:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:29,474 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-08 14:03:29,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-08 14:03:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-08 14:03:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-08 14:03:29,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:29,475 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-08 14:03:29,475 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-08 14:03:29,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:29,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:29,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-08 14:03:33,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:33,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:33,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:33,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:33,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:33,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:33,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:33,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:54,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-08 14:03:54,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:54,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-08 14:03:54,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-08 14:04:06,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:06,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-08 14:04:06,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:06,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-08 14:04:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-08 14:04:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-08 14:04:06,122 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-08 14:04:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:07,807 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-08 14:04:07,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-08 14:04:07,807 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-08 14:04:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:07,808 INFO L225 Difference]: With dead ends: 313 [2019-01-08 14:04:07,808 INFO L226 Difference]: Without dead ends: 209 [2019-01-08 14:04:07,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-08 14:04:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-08 14:04:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-08 14:04:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-08 14:04:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-08 14:04:07,814 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-08 14:04:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:07,814 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-08 14:04:07,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-08 14:04:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-08 14:04:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-08 14:04:07,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:07,815 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-08 14:04:07,815 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:07,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:07,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-08 14:04:07,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:07,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:07,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:07,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-08 14:04:11,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:11,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:11,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:11,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:11,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:11,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:11,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:04:11,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:04:11,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:04:11,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:11,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-08 14:04:12,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-08 14:04:23,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:23,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-08 14:04:23,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:23,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-08 14:04:23,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-08 14:04:23,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-08 14:04:23,741 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-08 14:04:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:25,152 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-08 14:04:25,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-08 14:04:25,153 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-08 14:04:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:25,153 INFO L225 Difference]: With dead ends: 316 [2019-01-08 14:04:25,153 INFO L226 Difference]: Without dead ends: 211 [2019-01-08 14:04:25,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-08 14:04:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-08 14:04:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-08 14:04:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-08 14:04:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-08 14:04:25,159 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-08 14:04:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:25,159 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-08 14:04:25,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-08 14:04:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-08 14:04:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-08 14:04:25,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:25,160 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-08 14:04:25,160 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-08 14:04:25,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:25,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:25,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-08 14:04:29,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:29,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:29,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:29,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:29,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:29,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:29,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:29,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:29,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-08 14:04:29,697 INFO L316 TraceCheckSpWp]: Computing backward predicates...