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/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:46:56,836 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:46:56,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:46:56,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:46:56,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:46:56,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:46:56,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:46:56,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:46:56,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:46:56,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:46:56,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:46:56,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:46:56,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:46:56,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:46:56,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:46:56,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:46:56,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:46:56,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:46:56,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:46:56,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:46:56,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:46:56,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:46:56,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:46:56,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:46:56,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:46:56,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:46:56,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:46:56,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:46:56,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:46:56,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:46:56,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:46:56,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:46:56,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:46:56,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:46:56,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:46:56,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:46:56,885 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-24 13:46:56,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:46:56,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:46:56,901 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:46:56,901 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:46:56,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:46:56,904 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:46:56,904 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:46:56,905 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:46:56,906 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:46:56,906 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:46:56,906 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:46:56,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:46:56,908 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:46:56,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:46:56,908 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:46:56,908 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:46:56,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:46:56,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:46:56,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:46:56,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:46:56,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:46:56,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:46:56,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:46:56,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:46:56,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:46:56,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:46:56,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:46:56,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:46:56,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:46:56,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:46:56,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:46:56,915 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:46:56,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:46:56,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:46:56,916 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:46:56,916 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:46:56,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:46:56,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:46:56,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:46:56,975 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:46:56,976 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:46:56,977 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-12-24 13:46:56,977 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-12-24 13:46:57,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:46:57,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:46:57,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:46:57,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:46:57,026 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:46:57,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:46:57,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:46:57,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:46:57,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:46:57,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:46:57,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:46:57,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:46:57,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:46:57,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:46:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:46:57,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:46:57,459 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:46:57,459 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-24 13:46:57,460 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:57 BoogieIcfgContainer [2018-12-24 13:46:57,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:46:57,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:46:57,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:46:57,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:46:57,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/2) ... [2018-12-24 13:46:57,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbf7c5 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:46:57, skipping insertion in model container [2018-12-24 13:46:57,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:57" (2/2) ... [2018-12-24 13:46:57,468 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-12-24 13:46:57,479 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:46:57,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 13:46:57,506 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 13:46:57,549 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:46:57,549 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:46:57,550 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:46:57,550 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:46:57,550 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:46:57,550 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:46:57,550 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:46:57,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:46:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-24 13:46:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:46:57,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:57,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:46:57,591 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-24 13:46:57,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:57,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:46:57,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-24 13:46:57,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:46:57,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:46:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:46:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:46:57,799 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-24 13:46:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:57,875 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-24 13:46:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:46:57,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 13:46:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:57,892 INFO L225 Difference]: With dead ends: 10 [2018-12-24 13:46:57,892 INFO L226 Difference]: Without dead ends: 6 [2018-12-24 13:46:57,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:46:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-24 13:46:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-24 13:46:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 13:46:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-24 13:46:57,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-12-24 13:46:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:57,931 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-24 13:46:57,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:46:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-24 13:46:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:46:57,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:57,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:46:57,933 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2018-12-24 13:46:57,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:57,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:57,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:46:58,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-24 13:46:58,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:46:58,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:46:58,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:46:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:46:58,095 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-24 13:46:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:58,176 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-24 13:46:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:46:58,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:46:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:58,178 INFO L225 Difference]: With dead ends: 11 [2018-12-24 13:46:58,178 INFO L226 Difference]: Without dead ends: 7 [2018-12-24 13:46:58,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:46:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-24 13:46:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-24 13:46:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 13:46:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-24 13:46:58,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-24 13:46:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:58,183 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-24 13:46:58,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:46:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-24 13:46:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:46:58,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:58,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:46:58,184 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-24 13:46:58,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:58,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:58,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:58,461 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:46:58,465 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-24 13:46:58,522 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:46:58,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:46:58,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:46:58,682 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 5 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 13:46:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:46:58,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,689 INFO 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 [2018-12-24 13:46:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:58,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:46:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:59,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:46:59,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:46:59,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:46:59,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:46:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:59,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:46:59,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:46:59,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:46:59,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:46:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:59,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-24 13:46:59,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:59,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:46:59,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:46:59,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:46:59,652 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2018-12-24 13:47:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:00,083 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-24 13:47:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:47:00,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:47:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:00,084 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:47:00,085 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 13:47:00,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 13:47:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-24 13:47:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 13:47:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-24 13:47:00,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-24 13:47:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:00,090 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-24 13:47:00,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:47:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-24 13:47:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:47:00,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:00,092 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-24 13:47:00,092 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2018-12-24 13:47:00,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:00,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:00,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:00,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:00,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:00,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:00,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:47:00,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:00,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:00,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-24 13:47:00,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:00,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 13:47:00,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 13:47:00,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-24 13:47:00,439 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2018-12-24 13:47:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:00,783 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-24 13:47:00,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:47:00,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-24 13:47:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:00,788 INFO L225 Difference]: With dead ends: 11 [2018-12-24 13:47:00,788 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 13:47:00,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:47:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 13:47:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 13:47:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:47:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-24 13:47:00,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-12-24 13:47:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:00,793 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-24 13:47:00,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 13:47:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-24 13:47:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:47:00,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:00,794 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-24 13:47:00,794 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2018-12-24 13:47:00,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:01,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:01,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:01,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:01,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,031 INFO 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 [2018-12-24 13:47:01,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:01,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:01,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:01,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:01,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:01,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:01,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:01,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:01,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:47:01,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:01,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:01,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:01,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:01,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:47:01,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:01,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2018-12-24 13:47:01,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:01,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:47:01,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:47:01,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:01,473 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2018-12-24 13:47:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:02,038 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-24 13:47:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 13:47:02,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-24 13:47:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:02,040 INFO L225 Difference]: With dead ends: 17 [2018-12-24 13:47:02,040 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 13:47:02,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-24 13:47:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 13:47:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 13:47:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 13:47:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-24 13:47:02,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-24 13:47:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:02,046 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-24 13:47:02,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:47:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-24 13:47:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 13:47:02,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:02,047 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-24 13:47:02,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2018-12-24 13:47:02,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:02,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:02,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:02,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:02,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:02,232 INFO 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 [2018-12-24 13:47:02,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:02,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:02,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:02,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:02,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:02,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:02,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:02,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:02,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:02,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:02,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:02,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2018-12-24 13:47:02,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:02,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 13:47:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 13:47:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:47:02,672 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2018-12-24 13:47:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:03,091 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-24 13:47:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 13:47:03,092 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2018-12-24 13:47:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:03,093 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:47:03,093 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:47:03,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:47:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:47:03,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-24 13:47:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-24 13:47:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-24 13:47:03,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-12-24 13:47:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:03,099 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-24 13:47:03,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 13:47:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-24 13:47:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-24 13:47:03,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:03,100 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-12-24 13:47:03,100 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2018-12-24 13:47:03,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:03,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:03,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:03,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:03,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,177 INFO 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 [2018-12-24 13:47:03,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:03,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:03,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:47:03,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:03,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:03,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:03,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:03,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-24 13:47:03,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:03,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:47:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:47:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:47:03,316 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2018-12-24 13:47:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:03,461 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-24 13:47:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 13:47:03,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-24 13:47:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:03,462 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:47:03,462 INFO L226 Difference]: Without dead ends: 13 [2018-12-24 13:47:03,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:47:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-24 13:47:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-24 13:47:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:47:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-24 13:47:03,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-24 13:47:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:03,470 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-24 13:47:03,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:47:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-24 13:47:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 13:47:03,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:03,471 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-24 13:47:03,471 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2018-12-24 13:47:03,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:03,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:03,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:03,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:03,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:03,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:03,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,677 INFO 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 [2018-12-24 13:47:03,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:03,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:03,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:03,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:03,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:03,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:03,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:03,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:03,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 13:47:03,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:03,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:03,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:03,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:03,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 13:47:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:04,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2018-12-24 13:47:04,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:04,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-24 13:47:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-24 13:47:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:47:04,078 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2018-12-24 13:47:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:04,937 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-12-24 13:47:04,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 13:47:04,938 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2018-12-24 13:47:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:04,939 INFO L225 Difference]: With dead ends: 23 [2018-12-24 13:47:04,939 INFO L226 Difference]: Without dead ends: 15 [2018-12-24 13:47:04,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2018-12-24 13:47:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-24 13:47:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-24 13:47:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-24 13:47:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-24 13:47:04,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-24 13:47:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:04,947 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-24 13:47:04,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-24 13:47:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-24 13:47:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-24 13:47:04,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:04,948 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-24 13:47:04,948 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:04,948 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2018-12-24 13:47:04,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:04,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:05,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:05,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:05,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:05,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,256 INFO 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 [2018-12-24 13:47:05,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:05,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:05,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:05,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:05,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:05,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:05,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:05,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:05,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:05,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:05,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:05,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:05,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:05,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-12-24 13:47:05,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:05,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 13:47:05,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 13:47:05,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:47:05,632 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2018-12-24 13:47:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:06,503 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-24 13:47:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 13:47:06,503 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2018-12-24 13:47:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:06,504 INFO L225 Difference]: With dead ends: 24 [2018-12-24 13:47:06,504 INFO L226 Difference]: Without dead ends: 16 [2018-12-24 13:47:06,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-12-24 13:47:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-24 13:47:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-24 13:47:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 13:47:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-24 13:47:06,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-24 13:47:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:06,511 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-24 13:47:06,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 13:47:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-24 13:47:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-24 13:47:06,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:06,512 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-12-24 13:47:06,512 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:06,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2018-12-24 13:47:06,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:06,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:06,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:06,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:06,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:06,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:06,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:06,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:06,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:06,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:06,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:06,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:06,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:06,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 13:47:06,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:06,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:06,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:07,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:07,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-24 13:47:07,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:07,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:47:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:47:07,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:47:07,058 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2018-12-24 13:47:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:07,173 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-24 13:47:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 13:47:07,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-24 13:47:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:07,176 INFO L225 Difference]: With dead ends: 19 [2018-12-24 13:47:07,176 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 13:47:07,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:47:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 13:47:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-24 13:47:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:47:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-24 13:47:07,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-12-24 13:47:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:07,184 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-24 13:47:07,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:47:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-24 13:47:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-24 13:47:07,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:07,185 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-24 13:47:07,185 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2018-12-24 13:47:07,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:07,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:07,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:07,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:07,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:07,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:07,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:07,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:07,464 INFO 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 [2018-12-24 13:47:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:07,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:07,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:07,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:07,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:07,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:07,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:07,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:07,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 13:47:07,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:07,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:07,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:07,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:07,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 13:47:07,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:07,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2018-12-24 13:47:07,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:07,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-24 13:47:07,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-24 13:47:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-12-24 13:47:07,985 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2018-12-24 13:47:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:08,846 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-12-24 13:47:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 13:47:08,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2018-12-24 13:47:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:08,848 INFO L225 Difference]: With dead ends: 29 [2018-12-24 13:47:08,848 INFO L226 Difference]: Without dead ends: 19 [2018-12-24 13:47:08,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 13:47:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-24 13:47:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-24 13:47:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 13:47:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-24 13:47:08,856 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-24 13:47:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:08,857 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-24 13:47:08,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-24 13:47:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-24 13:47:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-24 13:47:08,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:08,858 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-24 13:47:08,858 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:08,858 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2018-12-24 13:47:08,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:08,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:08,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:08,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:08,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:09,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:09,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:09,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:09,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:09,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:09,216 INFO 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 [2018-12-24 13:47:09,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:09,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:09,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:09,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:09,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:09,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:09,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:09,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:09,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:09,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:09,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:09,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:09,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:09,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-12-24 13:47:09,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:09,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 13:47:09,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 13:47:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2018-12-24 13:47:09,949 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2018-12-24 13:47:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:10,659 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-24 13:47:10,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 13:47:10,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2018-12-24 13:47:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:10,661 INFO L225 Difference]: With dead ends: 30 [2018-12-24 13:47:10,661 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 13:47:10,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 13:47:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-24 13:47:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-24 13:47:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-24 13:47:10,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-12-24 13:47:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:10,668 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-24 13:47:10,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 13:47:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-24 13:47:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-24 13:47:10,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:10,669 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-12-24 13:47:10,669 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2018-12-24 13:47:10,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:10,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:10,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:10,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:10,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:10,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:10,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:10,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:10,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:10,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:10,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:10,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-24 13:47:10,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:10,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:10,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:10,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:10,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-24 13:47:10,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:10,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:47:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:47:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:47:10,968 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2018-12-24 13:47:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:11,479 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-24 13:47:11,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 13:47:11,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-12-24 13:47:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:11,481 INFO L225 Difference]: With dead ends: 23 [2018-12-24 13:47:11,481 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 13:47:11,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:47:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 13:47:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-24 13:47:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 13:47:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-24 13:47:11,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-24 13:47:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:11,489 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-24 13:47:11,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:47:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-24 13:47:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 13:47:11,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:11,490 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-24 13:47:11,490 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2018-12-24 13:47:11,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:11,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:11,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:11,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:11,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:11,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:11,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:11,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:11,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:11,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:11,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:11,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:11,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:11,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:11,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:12,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:12,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:12,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:12,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 13:47:12,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:12,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:12,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:12,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:12,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 13:47:12,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:12,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2018-12-24 13:47:12,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:12,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-24 13:47:12,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-24 13:47:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:12,545 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2018-12-24 13:47:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:13,748 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-24 13:47:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 13:47:13,749 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2018-12-24 13:47:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:13,750 INFO L225 Difference]: With dead ends: 35 [2018-12-24 13:47:13,750 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 13:47:13,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2018-12-24 13:47:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 13:47:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-24 13:47:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 13:47:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-24 13:47:13,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-24 13:47:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:13,762 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-24 13:47:13,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-24 13:47:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-24 13:47:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-24 13:47:13,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:13,763 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-24 13:47:13,763 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2018-12-24 13:47:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:13,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:13,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:14,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:14,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:14,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:14,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:14,355 INFO 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 [2018-12-24 13:47:14,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:14,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:14,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:14,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:14,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:14,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:14,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:14,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:14,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:14,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:14,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:15,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-12-24 13:47:15,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:15,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 13:47:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 13:47:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 13:47:15,158 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2018-12-24 13:47:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:16,006 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-24 13:47:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 13:47:16,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2018-12-24 13:47:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:16,008 INFO L225 Difference]: With dead ends: 36 [2018-12-24 13:47:16,008 INFO L226 Difference]: Without dead ends: 24 [2018-12-24 13:47:16,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 13:47:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-24 13:47:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-24 13:47:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-24 13:47:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-24 13:47:16,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-12-24 13:47:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:16,017 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-24 13:47:16,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 13:47:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-24 13:47:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-24 13:47:16,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:16,017 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2018-12-24 13:47:16,018 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2018-12-24 13:47:16,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:16,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:16,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:16,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:16,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:16,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,692 INFO 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 [2018-12-24 13:47:16,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:16,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:16,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-24 13:47:16,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:16,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:16,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-24 13:47:16,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:16,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:47:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:47:16,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:47:16,897 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2018-12-24 13:47:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:17,037 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-24 13:47:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 13:47:17,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-12-24 13:47:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:17,039 INFO L225 Difference]: With dead ends: 27 [2018-12-24 13:47:17,039 INFO L226 Difference]: Without dead ends: 25 [2018-12-24 13:47:17,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:47:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-24 13:47:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-24 13:47:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 13:47:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-24 13:47:17,050 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-24 13:47:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:17,050 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-24 13:47:17,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:47:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-24 13:47:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 13:47:17,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:17,051 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-24 13:47:17,052 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2018-12-24 13:47:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:17,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:17,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:17,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,510 INFO 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 [2018-12-24 13:47:17,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:17,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:17,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:17,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:17,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:17,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:17,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 13:47:17,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:17,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:17,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 13:47:18,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:18,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2018-12-24 13:47:18,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:18,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-24 13:47:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-24 13:47:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 13:47:18,391 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2018-12-24 13:47:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:20,291 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-24 13:47:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 13:47:20,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2018-12-24 13:47:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:20,293 INFO L225 Difference]: With dead ends: 41 [2018-12-24 13:47:20,293 INFO L226 Difference]: Without dead ends: 27 [2018-12-24 13:47:20,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2018-12-24 13:47:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-24 13:47:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-24 13:47:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-24 13:47:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-24 13:47:20,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-24 13:47:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:20,310 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-24 13:47:20,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-24 13:47:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-24 13:47:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-24 13:47:20,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:20,311 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-24 13:47:20,311 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:20,312 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2018-12-24 13:47:20,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:20,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:20,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:20,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:20,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:20,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:20,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,810 INFO 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 [2018-12-24 13:47:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:20,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:20,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:21,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:21,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:21,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:21,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-12-24 13:47:21,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:21,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 13:47:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 13:47:21,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 13:47:21,488 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2018-12-24 13:47:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:22,670 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-24 13:47:22,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 13:47:22,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2018-12-24 13:47:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:22,672 INFO L225 Difference]: With dead ends: 42 [2018-12-24 13:47:22,672 INFO L226 Difference]: Without dead ends: 28 [2018-12-24 13:47:22,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 13:47:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-24 13:47:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-24 13:47:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 13:47:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-24 13:47:22,681 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-24 13:47:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:22,681 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-24 13:47:22,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 13:47:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-24 13:47:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-24 13:47:22,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:22,682 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2018-12-24 13:47:22,682 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2018-12-24 13:47:22,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:22,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:22,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:22,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:22,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:22,872 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:22,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:22,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:22,873 INFO 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 [2018-12-24 13:47:22,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:22,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:22,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-24 13:47:22,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:22,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:22,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:23,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-24 13:47:23,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:23,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-24 13:47:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-24 13:47:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:47:23,277 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2018-12-24 13:47:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:23,511 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-24 13:47:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 13:47:23,511 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-12-24 13:47:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:23,513 INFO L225 Difference]: With dead ends: 31 [2018-12-24 13:47:23,513 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 13:47:23,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2018-12-24 13:47:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 13:47:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-24 13:47:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 13:47:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-24 13:47:23,524 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-12-24 13:47:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:23,524 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-24 13:47:23,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-24 13:47:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-24 13:47:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-24 13:47:23,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:23,525 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-24 13:47:23,525 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2018-12-24 13:47:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:23,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:23,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:23,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:23,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:23,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,964 INFO 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 [2018-12-24 13:47:23,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:23,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:23,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:23,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:23,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:24,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:24,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:24,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:24,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 13:47:24,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:24,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:24,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:24,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:24,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 13:47:25,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:25,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2018-12-24 13:47:25,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:25,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-24 13:47:25,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-24 13:47:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 13:47:25,429 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2018-12-24 13:47:26,477 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-24 13:47:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:27,711 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-24 13:47:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 13:47:27,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2018-12-24 13:47:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:27,719 INFO L225 Difference]: With dead ends: 47 [2018-12-24 13:47:27,719 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 13:47:27,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 13:47:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 13:47:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-24 13:47:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:47:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-24 13:47:27,731 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-24 13:47:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:27,732 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-24 13:47:27,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-24 13:47:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-24 13:47:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 13:47:27,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:27,733 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-24 13:47:27,733 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2018-12-24 13:47:27,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:27,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:27,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:28,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:28,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:28,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:28,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:28,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:28,737 INFO 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 [2018-12-24 13:47:28,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:28,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:28,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:29,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:29,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:29,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:29,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:29,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:29,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:29,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-12-24 13:47:29,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:29,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 13:47:29,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 13:47:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 13:47:29,611 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2018-12-24 13:47:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:31,034 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-24 13:47:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 13:47:31,034 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2018-12-24 13:47:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:31,035 INFO L225 Difference]: With dead ends: 48 [2018-12-24 13:47:31,035 INFO L226 Difference]: Without dead ends: 32 [2018-12-24 13:47:31,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-24 13:47:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-24 13:47:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:47:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-24 13:47:31,049 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-12-24 13:47:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:31,049 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-24 13:47:31,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 13:47:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-24 13:47:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-24 13:47:31,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:31,050 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2018-12-24 13:47:31,050 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2018-12-24 13:47:31,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:31,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:31,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:31,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:31,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:31,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:31,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:31,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:31,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:31,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:31,608 INFO 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 [2018-12-24 13:47:31,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:31,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:31,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-24 13:47:31,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:31,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:31,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:32,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:32,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-24 13:47:32,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:32,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-24 13:47:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-24 13:47:32,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:47:32,216 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2018-12-24 13:47:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:32,424 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-24 13:47:32,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 13:47:32,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-12-24 13:47:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:32,426 INFO L225 Difference]: With dead ends: 35 [2018-12-24 13:47:32,426 INFO L226 Difference]: Without dead ends: 33 [2018-12-24 13:47:32,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2018-12-24 13:47:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-24 13:47:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-24 13:47:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 13:47:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-24 13:47:32,444 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-12-24 13:47:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:32,444 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-24 13:47:32,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-24 13:47:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-24 13:47:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-24 13:47:32,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:32,445 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-24 13:47:32,445 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2018-12-24 13:47:32,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:32,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:32,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:33,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:33,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:33,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:33,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:33,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:33,201 INFO 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 [2018-12-24 13:47:33,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:33,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:33,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:33,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:33,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:33,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:33,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:33,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:33,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 13:47:33,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:33,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:33,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:33,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:33,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 13:47:34,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:34,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2018-12-24 13:47:34,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:34,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-24 13:47:34,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-24 13:47:34,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:34,778 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2018-12-24 13:47:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:36,780 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-24 13:47:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 13:47:36,781 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2018-12-24 13:47:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:36,782 INFO L225 Difference]: With dead ends: 53 [2018-12-24 13:47:36,782 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:47:36,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2018-12-24 13:47:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:47:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-24 13:47:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 13:47:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-24 13:47:36,796 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-24 13:47:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:36,796 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-24 13:47:36,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-24 13:47:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-24 13:47:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-24 13:47:36,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:36,797 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-24 13:47:36,797 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:36,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2018-12-24 13:47:36,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:36,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:36,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:37,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:37,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:37,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:37,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:37,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:37,589 INFO 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 [2018-12-24 13:47:37,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:37,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:37,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:38,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:38,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:38,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:38,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:38,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:38,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:38,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:38,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:38,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:38,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:38,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-24 13:47:38,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:38,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 13:47:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 13:47:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 13:47:38,628 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2018-12-24 13:47:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:40,552 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-24 13:47:40,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 13:47:40,553 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2018-12-24 13:47:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:40,553 INFO L225 Difference]: With dead ends: 54 [2018-12-24 13:47:40,554 INFO L226 Difference]: Without dead ends: 36 [2018-12-24 13:47:40,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 13:47:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-24 13:47:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-24 13:47:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:47:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-24 13:47:40,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-12-24 13:47:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:40,570 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-24 13:47:40,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 13:47:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-24 13:47:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-24 13:47:40,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:40,571 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2018-12-24 13:47:40,571 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2018-12-24 13:47:40,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:40,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:40,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:40,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:40,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:41,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:41,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:41,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:41,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:41,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:41,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:41,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:41,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-24 13:47:41,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:41,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:41,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-24 13:47:41,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:41,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-24 13:47:41,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-24 13:47:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:47:41,479 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2018-12-24 13:47:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:41,700 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-24 13:47:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 13:47:41,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-12-24 13:47:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:41,701 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:47:41,702 INFO L226 Difference]: Without dead ends: 37 [2018-12-24 13:47:41,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 13:47:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-24 13:47:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-24 13:47:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:47:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-24 13:47:41,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-24 13:47:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:41,721 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-24 13:47:41,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-24 13:47:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-24 13:47:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 13:47:41,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:41,722 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-24 13:47:41,722 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2018-12-24 13:47:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:41,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:41,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:42,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:42,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:42,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:42,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:42,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:42,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:42,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:42,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:42,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:43,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:43,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:43,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:43,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 13:47:43,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:43,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:43,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:43,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:43,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 13:47:44,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:44,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2018-12-24 13:47:44,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:44,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-24 13:47:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-24 13:47:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 13:47:44,454 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2018-12-24 13:47:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:46,945 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-24 13:47:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 13:47:46,946 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2018-12-24 13:47:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:46,946 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:47:46,946 INFO L226 Difference]: Without dead ends: 39 [2018-12-24 13:47:46,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2018-12-24 13:47:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-24 13:47:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-24 13:47:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 13:47:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-24 13:47:46,963 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-24 13:47:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:46,963 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-24 13:47:46,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-24 13:47:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-24 13:47:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-24 13:47:46,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:46,964 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-24 13:47:46,964 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2018-12-24 13:47:46,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:46,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:46,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:46,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:46,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:48,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:48,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:48,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:48,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:48,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:48,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:48,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:48,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:48,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:49,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:49,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:49,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:49,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:47:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:49,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:49,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:49,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:49,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:49,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:47:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:49,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:49,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2018-12-24 13:47:49,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:49,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 13:47:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 13:47:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 13:47:49,414 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2018-12-24 13:47:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:51,654 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-24 13:47:51,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 13:47:51,655 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2018-12-24 13:47:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:51,655 INFO L225 Difference]: With dead ends: 60 [2018-12-24 13:47:51,655 INFO L226 Difference]: Without dead ends: 40 [2018-12-24 13:47:51,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 13:47:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-24 13:47:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-24 13:47:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 13:47:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-24 13:47:51,673 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-24 13:47:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:51,674 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-24 13:47:51,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 13:47:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-24 13:47:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-24 13:47:51,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:51,674 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2018-12-24 13:47:51,674 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2018-12-24 13:47:51,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:51,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:51,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:51,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:51,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:51,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:51,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:51,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:51,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:51,936 INFO 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 [2018-12-24 13:47:51,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:51,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:52,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-24 13:47:52,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:52,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:52,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:52,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:52,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-24 13:47:52,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:52,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-24 13:47:52,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-24 13:47:52,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-12-24 13:47:52,419 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2018-12-24 13:47:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:52,680 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-24 13:47:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 13:47:52,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-12-24 13:47:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:52,681 INFO L225 Difference]: With dead ends: 43 [2018-12-24 13:47:52,681 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 13:47:52,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2018-12-24 13:47:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 13:47:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-24 13:47:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:47:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-24 13:47:52,700 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-12-24 13:47:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:52,701 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-24 13:47:52,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-24 13:47:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-24 13:47:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 13:47:52,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:52,701 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-24 13:47:52,701 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:52,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:52,702 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2018-12-24 13:47:52,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:52,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:52,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:53,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:53,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:53,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:53,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:53,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:53,982 INFO 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 [2018-12-24 13:47:53,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:53,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:54,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:54,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:54,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:54,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:47:54,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:54,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:54,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:47:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 13:47:54,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:55,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:47:55,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:55,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:55,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:47:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 13:47:56,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:56,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2018-12-24 13:47:56,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:56,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-24 13:47:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-24 13:47:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 13:47:56,356 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2018-12-24 13:47:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:59,000 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-24 13:47:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 13:47:59,000 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2018-12-24 13:47:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:59,001 INFO L225 Difference]: With dead ends: 65 [2018-12-24 13:47:59,001 INFO L226 Difference]: Without dead ends: 43 [2018-12-24 13:47:59,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 13:47:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-24 13:47:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-24 13:47:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 13:47:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-24 13:47:59,026 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-24 13:47:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:59,026 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-24 13:47:59,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-24 13:47:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-24 13:47:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-24 13:47:59,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:59,027 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-24 13:47:59,028 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2018-12-24 13:47:59,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:59,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:59,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:59,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:59,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:59,972 INFO 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 [2018-12-24 13:47:59,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:59,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:00,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:01,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:48:01,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:01,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:01,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:48:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:01,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:01,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:48:01,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:01,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:01,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:48:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2018-12-24 13:48:01,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:01,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 13:48:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 13:48:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 13:48:01,710 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2018-12-24 13:48:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:04,176 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-24 13:48:04,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 13:48:04,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2018-12-24 13:48:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:04,178 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:48:04,178 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:48:04,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:48:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:48:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-24 13:48:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-24 13:48:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-24 13:48:04,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-12-24 13:48:04,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:04,203 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-24 13:48:04,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 13:48:04,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-24 13:48:04,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-24 13:48:04,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:04,204 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2018-12-24 13:48:04,204 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:04,205 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2018-12-24 13:48:04,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:04,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:04,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:04,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:04,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:04,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:04,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:04,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:04,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:04,550 INFO 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 [2018-12-24 13:48:04,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:04,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:04,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-24 13:48:04,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:04,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:04,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:05,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:05,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-24 13:48:05,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:05,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-24 13:48:05,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-24 13:48:05,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:48:05,036 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2018-12-24 13:48:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:05,344 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-24 13:48:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 13:48:05,344 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-12-24 13:48:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:05,345 INFO L225 Difference]: With dead ends: 47 [2018-12-24 13:48:05,345 INFO L226 Difference]: Without dead ends: 45 [2018-12-24 13:48:05,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2018-12-24 13:48:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-24 13:48:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-24 13:48:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 13:48:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-24 13:48:05,364 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-12-24 13:48:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:05,365 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-24 13:48:05,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-24 13:48:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-24 13:48:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-24 13:48:05,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:05,365 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-24 13:48:05,365 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2018-12-24 13:48:05,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:05,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:05,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:05,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:05,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:06,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:06,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:06,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:06,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:06,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:06,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:06,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:06,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:06,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:06,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:06,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:07,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:48:07,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:07,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:07,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:48:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 13:48:07,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:08,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:48:08,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:08,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:08,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:48:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 13:48:09,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:09,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2018-12-24 13:48:09,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:09,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-24 13:48:09,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-24 13:48:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:48:09,356 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2018-12-24 13:48:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:12,826 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-24 13:48:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 13:48:12,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2018-12-24 13:48:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:12,827 INFO L225 Difference]: With dead ends: 71 [2018-12-24 13:48:12,827 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 13:48:12,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2018-12-24 13:48:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 13:48:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-24 13:48:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 13:48:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-24 13:48:12,849 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-24 13:48:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:12,849 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-24 13:48:12,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-24 13:48:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-24 13:48:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-24 13:48:12,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:12,850 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-24 13:48:12,850 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2018-12-24 13:48:12,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:12,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:12,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:13,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:13,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:13,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:13,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:13,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:13,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:13,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:13,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:14,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:15,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:48:15,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:15,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:15,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:48:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:15,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:15,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:48:15,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:15,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:15,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:48:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:15,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:15,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2018-12-24 13:48:15,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:15,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 13:48:15,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 13:48:15,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 13:48:15,763 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2018-12-24 13:48:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:18,946 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-24 13:48:18,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 13:48:18,947 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2018-12-24 13:48:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:18,947 INFO L225 Difference]: With dead ends: 72 [2018-12-24 13:48:18,948 INFO L226 Difference]: Without dead ends: 48 [2018-12-24 13:48:18,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 13:48:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-24 13:48:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-24 13:48:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-24 13:48:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-24 13:48:18,968 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-12-24 13:48:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:18,968 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-24 13:48:18,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 13:48:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-24 13:48:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-24 13:48:18,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:18,969 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2018-12-24 13:48:18,969 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:18,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:18,969 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2018-12-24 13:48:18,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:18,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:18,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:19,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:19,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:19,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:19,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:19,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:19,893 INFO 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 [2018-12-24 13:48:19,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:19,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:19,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-24 13:48:19,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:19,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:19,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:20,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:20,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-24 13:48:20,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:20,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-24 13:48:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-24 13:48:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-12-24 13:48:20,413 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2018-12-24 13:48:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:20,766 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-24 13:48:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 13:48:20,766 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-12-24 13:48:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:20,767 INFO L225 Difference]: With dead ends: 51 [2018-12-24 13:48:20,767 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 13:48:20,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 13:48:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 13:48:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-24 13:48:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 13:48:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-24 13:48:20,791 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-24 13:48:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:20,791 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-24 13:48:20,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-24 13:48:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-24 13:48:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 13:48:20,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:20,792 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-24 13:48:20,792 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2018-12-24 13:48:20,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:20,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:20,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:22,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:22,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:22,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:22,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:22,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:22,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:22,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:22,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:22,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:22,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:22,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:23,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:48:23,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:48:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 13:48:23,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:23,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:48:23,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:48:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 13:48:25,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:25,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2018-12-24 13:48:25,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:25,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-24 13:48:25,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-24 13:48:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 13:48:25,377 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2018-12-24 13:48:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:29,272 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-24 13:48:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 13:48:29,272 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2018-12-24 13:48:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:29,273 INFO L225 Difference]: With dead ends: 77 [2018-12-24 13:48:29,273 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 13:48:29,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2018-12-24 13:48:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 13:48:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-24 13:48:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 13:48:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-24 13:48:29,295 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-24 13:48:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:29,295 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-24 13:48:29,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-24 13:48:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-24 13:48:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-24 13:48:29,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:29,296 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-24 13:48:29,296 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2018-12-24 13:48:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:29,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:29,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:30,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:30,885 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:30,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:30,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,885 INFO 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 [2018-12-24 13:48:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:30,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:30,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:32,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:48:32,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:32,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:32,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:48:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:32,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:32,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:48:32,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:32,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:32,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:48:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:33,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:33,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2018-12-24 13:48:33,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:33,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 13:48:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 13:48:33,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 13:48:33,160 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2018-12-24 13:48:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:36,150 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-24 13:48:36,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 13:48:36,150 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2018-12-24 13:48:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:36,151 INFO L225 Difference]: With dead ends: 78 [2018-12-24 13:48:36,151 INFO L226 Difference]: Without dead ends: 52 [2018-12-24 13:48:36,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 13:48:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-24 13:48:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-24 13:48:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 13:48:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-24 13:48:36,176 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-24 13:48:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:36,176 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-24 13:48:36,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 13:48:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-24 13:48:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-24 13:48:36,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:36,177 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2018-12-24 13:48:36,177 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:36,177 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2018-12-24 13:48:36,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:36,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:36,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:36,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:36,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:36,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:36,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:36,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:36,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:36,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:36,891 INFO 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 [2018-12-24 13:48:36,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:36,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:37,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-24 13:48:37,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:37,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:37,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:37,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:37,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-24 13:48:37,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:37,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-24 13:48:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-24 13:48:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-12-24 13:48:37,506 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2018-12-24 13:48:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:37,913 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-24 13:48:37,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 13:48:37,913 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-12-24 13:48:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:37,914 INFO L225 Difference]: With dead ends: 55 [2018-12-24 13:48:37,914 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 13:48:37,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2018-12-24 13:48:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 13:48:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-24 13:48:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 13:48:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-24 13:48:37,940 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2018-12-24 13:48:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:37,940 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-24 13:48:37,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-24 13:48:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-24 13:48:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-24 13:48:37,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:37,941 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-24 13:48:37,941 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2018-12-24 13:48:37,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:37,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:37,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:39,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:39,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:39,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:39,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:39,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:39,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:39,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:39,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:39,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:39,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:39,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:41,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:48:41,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:41,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:41,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:48:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 13:48:41,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:41,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:48:41,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:41,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:41,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:48:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 13:48:43,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:43,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2018-12-24 13:48:43,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:43,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-24 13:48:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-24 13:48:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 13:48:43,904 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2018-12-24 13:48:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:48,269 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-24 13:48:48,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 13:48:48,270 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2018-12-24 13:48:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:48,271 INFO L225 Difference]: With dead ends: 83 [2018-12-24 13:48:48,271 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 13:48:48,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 13:48:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 13:48:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-24 13:48:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 13:48:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-24 13:48:48,307 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-24 13:48:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:48,308 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-24 13:48:48,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-24 13:48:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-24 13:48:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-24 13:48:48,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:48,308 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-24 13:48:48,309 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:48,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:48,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2018-12-24 13:48:48,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:48,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:48,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:50,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:50,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:50,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:50,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:50,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:50,252 INFO 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 [2018-12-24 13:48:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:50,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:50,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:52,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:48:52,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:52,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:52,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:48:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:52,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:52,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:48:52,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:52,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:52,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:48:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:52,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:52,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2018-12-24 13:48:52,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:52,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 13:48:52,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 13:48:52,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 13:48:52,952 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2018-12-24 13:48:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:56,755 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-12-24 13:48:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 13:48:56,755 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2018-12-24 13:48:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:56,756 INFO L225 Difference]: With dead ends: 84 [2018-12-24 13:48:56,756 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 13:48:56,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:48:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 13:48:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-24 13:48:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-24 13:48:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-24 13:48:56,782 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-12-24 13:48:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:56,783 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-24 13:48:56,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 13:48:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-24 13:48:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-24 13:48:56,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:56,783 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2018-12-24 13:48:56,784 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2018-12-24 13:48:56,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:56,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:57,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:57,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:57,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:57,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:57,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:57,246 INFO 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 [2018-12-24 13:48:57,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:57,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:57,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-24 13:48:57,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:57,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:57,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-24 13:48:58,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:58,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-24 13:48:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-24 13:48:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-12-24 13:48:58,007 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2018-12-24 13:48:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:58,485 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-24 13:48:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 13:48:58,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-12-24 13:48:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:58,486 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:48:58,486 INFO L226 Difference]: Without dead ends: 57 [2018-12-24 13:48:58,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2018-12-24 13:48:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-24 13:48:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-24 13:48:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-24 13:48:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-24 13:48:58,514 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2018-12-24 13:48:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:58,514 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-24 13:48:58,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-24 13:48:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-24 13:48:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-24 13:48:58,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:58,515 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-24 13:48:58,515 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2018-12-24 13:48:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:58,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:58,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:58,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:00,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:00,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:00,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:00,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:00,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:00,534 INFO 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 [2018-12-24 13:49:00,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:00,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:00,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:00,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:00,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:02,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:49:02,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:02,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:02,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:49:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 13:49:02,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:02,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:49:02,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:02,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:02,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:49:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 13:49:04,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:04,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2018-12-24 13:49:04,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:04,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-24 13:49:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-24 13:49:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:49:04,800 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2018-12-24 13:49:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:09,855 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-24 13:49:09,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 13:49:09,856 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2018-12-24 13:49:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:09,857 INFO L225 Difference]: With dead ends: 89 [2018-12-24 13:49:09,857 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 13:49:09,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2018-12-24 13:49:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 13:49:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-24 13:49:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 13:49:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-24 13:49:09,888 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-24 13:49:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:09,888 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-24 13:49:09,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-24 13:49:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-24 13:49:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-24 13:49:09,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:09,889 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-24 13:49:09,889 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2018-12-24 13:49:09,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:09,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:09,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:11,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:11,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:11,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:11,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:11,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:11,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:11,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:11,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:11,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:13,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:49:13,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:49:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:13,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:13,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:49:13,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:49:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:14,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:14,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2018-12-24 13:49:14,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:14,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 13:49:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 13:49:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 13:49:14,682 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2018-12-24 13:49:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:19,176 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-12-24 13:49:19,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 13:49:19,177 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2018-12-24 13:49:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:19,177 INFO L225 Difference]: With dead ends: 90 [2018-12-24 13:49:19,178 INFO L226 Difference]: Without dead ends: 60 [2018-12-24 13:49:19,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 13:49:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-24 13:49:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-24 13:49:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-24 13:49:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-24 13:49:19,209 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-12-24 13:49:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:19,209 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-24 13:49:19,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 13:49:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-24 13:49:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-24 13:49:19,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:19,210 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2018-12-24 13:49:19,210 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2018-12-24 13:49:19,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:19,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:19,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:20,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:20,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:20,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:20,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:20,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:20,111 INFO 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 [2018-12-24 13:49:20,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:20,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:20,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-24 13:49:20,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:20,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:20,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:20,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:20,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-24 13:49:20,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:20,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-24 13:49:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-24 13:49:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-12-24 13:49:20,969 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2018-12-24 13:49:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:21,469 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-24 13:49:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 13:49:21,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-12-24 13:49:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:21,470 INFO L225 Difference]: With dead ends: 63 [2018-12-24 13:49:21,470 INFO L226 Difference]: Without dead ends: 61 [2018-12-24 13:49:21,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 13:49:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-24 13:49:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-24 13:49:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:49:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-24 13:49:21,502 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-24 13:49:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:21,502 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-24 13:49:21,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-24 13:49:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-24 13:49:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 13:49:21,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:21,503 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-24 13:49:21,503 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2018-12-24 13:49:21,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:21,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:21,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:21,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:21,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:23,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:23,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:23,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:23,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:23,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:23,808 INFO 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 [2018-12-24 13:49:23,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:23,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:23,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:23,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:23,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:25,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:49:25,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:25,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:25,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:49:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 13:49:25,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:26,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:49:26,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:26,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:26,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:49:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 13:49:28,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:28,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2018-12-24 13:49:28,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:28,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-24 13:49:28,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-24 13:49:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 13:49:28,662 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2018-12-24 13:49:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:34,159 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-24 13:49:34,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 13:49:34,159 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2018-12-24 13:49:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:34,160 INFO L225 Difference]: With dead ends: 95 [2018-12-24 13:49:34,161 INFO L226 Difference]: Without dead ends: 63 [2018-12-24 13:49:34,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2018-12-24 13:49:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-24 13:49:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-24 13:49:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-24 13:49:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-24 13:49:34,195 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-24 13:49:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:34,195 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-24 13:49:34,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-24 13:49:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-24 13:49:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-24 13:49:34,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:34,196 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-24 13:49:34,196 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2018-12-24 13:49:34,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:34,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:34,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:36,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:36,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:36,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:36,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:36,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:36,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:36,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:36,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:36,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:38,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:49:38,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:38,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:38,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:49:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:38,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:38,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:49:38,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:38,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:38,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:49:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:39,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:39,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2018-12-24 13:49:39,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:39,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 13:49:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 13:49:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 13:49:39,520 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2018-12-24 13:49:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:44,609 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-12-24 13:49:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 13:49:44,610 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2018-12-24 13:49:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:44,611 INFO L225 Difference]: With dead ends: 96 [2018-12-24 13:49:44,611 INFO L226 Difference]: Without dead ends: 64 [2018-12-24 13:49:44,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 13:49:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-24 13:49:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-24 13:49:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-24 13:49:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-24 13:49:44,649 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-24 13:49:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:44,649 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-24 13:49:44,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 13:49:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-24 13:49:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-24 13:49:44,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:44,650 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2018-12-24 13:49:44,650 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2018-12-24 13:49:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:44,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:44,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:45,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:45,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:45,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:45,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:45,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:45,382 INFO 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 [2018-12-24 13:49:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:45,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:45,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-24 13:49:45,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:45,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:45,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:46,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:46,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-24 13:49:46,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:46,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-24 13:49:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-24 13:49:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-12-24 13:49:46,388 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2018-12-24 13:49:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:46,901 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-24 13:49:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 13:49:46,901 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-12-24 13:49:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:46,902 INFO L225 Difference]: With dead ends: 67 [2018-12-24 13:49:46,902 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 13:49:46,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2018-12-24 13:49:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 13:49:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-24 13:49:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-24 13:49:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-24 13:49:46,938 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2018-12-24 13:49:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:46,938 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-24 13:49:46,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-24 13:49:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-24 13:49:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-24 13:49:46,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:46,939 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-24 13:49:46,939 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2018-12-24 13:49:46,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:46,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:46,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:46,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:46,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:49,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:49,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:49,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:49,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:49,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:49,232 INFO 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 [2018-12-24 13:49:49,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:49,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:49,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:49,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:49,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:52,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:49:52,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:52,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:52,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:49:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 13:49:52,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:52,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:49:52,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:52,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:52,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:49:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 13:49:55,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:55,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2018-12-24 13:49:55,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:55,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-24 13:49:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-24 13:49:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 13:49:55,542 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2018-12-24 13:50:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:01,735 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-12-24 13:50:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 13:50:01,735 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2018-12-24 13:50:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:01,736 INFO L225 Difference]: With dead ends: 101 [2018-12-24 13:50:01,736 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 13:50:01,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 13:50:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 13:50:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-24 13:50:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 13:50:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-24 13:50:01,775 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-24 13:50:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:01,775 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-24 13:50:01,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-24 13:50:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-24 13:50:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-24 13:50:01,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:01,776 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-24 13:50:01,776 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2018-12-24 13:50:01,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:01,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:01,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:04,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:04,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:04,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:04,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:04,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:04,956 INFO 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 [2018-12-24 13:50:04,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:04,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:05,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:07,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:50:07,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:07,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:07,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:50:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:07,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:07,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:50:07,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:07,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:07,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:50:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:08,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2018-12-24 13:50:08,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 13:50:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 13:50:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 13:50:08,501 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2018-12-24 13:50:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:13,327 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-24 13:50:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 13:50:13,328 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2018-12-24 13:50:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:13,329 INFO L225 Difference]: With dead ends: 102 [2018-12-24 13:50:13,329 INFO L226 Difference]: Without dead ends: 68 [2018-12-24 13:50:13,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:50:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-24 13:50:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-24 13:50:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-24 13:50:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-12-24 13:50:13,373 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2018-12-24 13:50:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:13,373 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-12-24 13:50:13,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 13:50:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-12-24 13:50:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-24 13:50:13,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:13,374 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2018-12-24 13:50:13,374 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:13,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2018-12-24 13:50:13,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:13,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:13,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:13,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:13,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:14,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:14,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:14,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:14,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:14,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:14,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:14,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:14,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:14,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-24 13:50:14,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:14,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:14,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:15,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:15,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-24 13:50:15,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:15,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-24 13:50:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-24 13:50:15,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 13:50:15,545 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2018-12-24 13:50:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:16,124 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-12-24 13:50:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 13:50:16,124 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-12-24 13:50:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:16,125 INFO L225 Difference]: With dead ends: 71 [2018-12-24 13:50:16,125 INFO L226 Difference]: Without dead ends: 69 [2018-12-24 13:50:16,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2018-12-24 13:50:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-24 13:50:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-24 13:50:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 13:50:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-24 13:50:16,168 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2018-12-24 13:50:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:16,168 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-24 13:50:16,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-24 13:50:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-24 13:50:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-24 13:50:16,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:16,169 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-24 13:50:16,169 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:16,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:16,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2018-12-24 13:50:16,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:16,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:16,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:18,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:18,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:18,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:18,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:18,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:18,641 INFO 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 [2018-12-24 13:50:18,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:18,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:18,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:18,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:18,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:21,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:50:21,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:21,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:21,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:50:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 13:50:21,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:21,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:50:21,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:21,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:21,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:50:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 13:50:24,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:24,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2018-12-24 13:50:24,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:24,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-24 13:50:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-24 13:50:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:50:24,942 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2018-12-24 13:50:30,118 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-24 13:50:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:33,163 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-12-24 13:50:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-24 13:50:33,163 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2018-12-24 13:50:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:33,163 INFO L225 Difference]: With dead ends: 107 [2018-12-24 13:50:33,163 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 13:50:33,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 13:50:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 13:50:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-24 13:50:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 13:50:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-24 13:50:33,210 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-24 13:50:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:33,210 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-24 13:50:33,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-24 13:50:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-24 13:50:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-24 13:50:33,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:33,210 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-24 13:50:33,211 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:33,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:33,211 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2018-12-24 13:50:33,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:33,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:33,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:33,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:33,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:35,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:35,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:35,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:35,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:35,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:35,927 INFO 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 [2018-12-24 13:50:35,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:35,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:36,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:38,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:50:38,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:38,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:38,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:50:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:38,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:38,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:50:38,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:38,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:38,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:50:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:40,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:40,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2018-12-24 13:50:40,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:40,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 13:50:40,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 13:50:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 13:50:40,093 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2018-12-24 13:50:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:46,289 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-12-24 13:50:46,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 13:50:46,289 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2018-12-24 13:50:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:46,290 INFO L225 Difference]: With dead ends: 108 [2018-12-24 13:50:46,291 INFO L226 Difference]: Without dead ends: 72 [2018-12-24 13:50:46,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 13:50:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-24 13:50:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-24 13:50:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-24 13:50:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-24 13:50:46,334 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2018-12-24 13:50:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:46,334 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-24 13:50:46,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 13:50:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-24 13:50:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-24 13:50:46,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:46,335 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2018-12-24 13:50:46,335 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2018-12-24 13:50:46,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:46,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:46,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:46,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:47,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:47,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:47,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:47,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:47,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:47,256 INFO 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 [2018-12-24 13:50:47,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:47,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:47,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-24 13:50:47,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:47,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:47,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:48,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:48,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-24 13:50:48,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:48,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-24 13:50:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-24 13:50:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-12-24 13:50:48,597 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2018-12-24 13:50:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:49,267 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-24 13:50:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 13:50:49,268 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2018-12-24 13:50:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:49,268 INFO L225 Difference]: With dead ends: 75 [2018-12-24 13:50:49,269 INFO L226 Difference]: Without dead ends: 73 [2018-12-24 13:50:49,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 13:50:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-24 13:50:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-24 13:50:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:50:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-24 13:50:49,314 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-24 13:50:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:49,314 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-24 13:50:49,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-24 13:50:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-24 13:50:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 13:50:49,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:49,315 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-24 13:50:49,315 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2018-12-24 13:50:49,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:49,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:49,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:49,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:49,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:52,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:52,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:52,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:52,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:52,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:52,949 INFO 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 [2018-12-24 13:50:52,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:52,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:53,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:53,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:53,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:56,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:50:56,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:56,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:56,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:50:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 13:50:56,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:56,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:50:56,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:56,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:56,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:50:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 13:50:59,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:59,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2018-12-24 13:50:59,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:59,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-24 13:50:59,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-24 13:50:59,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 13:50:59,576 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2018-12-24 13:51:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:07,498 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-12-24 13:51:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-24 13:51:07,498 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2018-12-24 13:51:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:07,499 INFO L225 Difference]: With dead ends: 113 [2018-12-24 13:51:07,499 INFO L226 Difference]: Without dead ends: 75 [2018-12-24 13:51:07,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 13:51:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-24 13:51:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-24 13:51:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 13:51:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-24 13:51:07,549 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-24 13:51:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:07,549 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-24 13:51:07,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-24 13:51:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-24 13:51:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-24 13:51:07,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:07,550 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-24 13:51:07,550 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2018-12-24 13:51:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:07,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:07,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:07,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:10,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:10,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:10,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:10,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:10,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:10,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 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 [2018-12-24 13:51:10,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:10,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:10,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:13,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:51:13,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:51:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:13,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:13,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:51:13,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:51:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:14,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:14,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2018-12-24 13:51:14,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:14,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 13:51:14,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 13:51:14,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 13:51:14,977 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2018-12-24 13:51:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:21,874 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-12-24 13:51:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 13:51:21,874 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2018-12-24 13:51:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:21,875 INFO L225 Difference]: With dead ends: 114 [2018-12-24 13:51:21,875 INFO L226 Difference]: Without dead ends: 76 [2018-12-24 13:51:21,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 13:51:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-24 13:51:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-24 13:51:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 13:51:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-24 13:51:21,925 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-24 13:51:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:21,925 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-24 13:51:21,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-24 13:51:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-24 13:51:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-24 13:51:21,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:21,926 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2018-12-24 13:51:21,926 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:21,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2018-12-24 13:51:21,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:21,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:21,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:21,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:21,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:23,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:23,383 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:23,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:23,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:23,383 INFO 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 [2018-12-24 13:51:23,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:23,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:23,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-24 13:51:23,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:23,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:24,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:24,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-24 13:51:24,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:24,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-24 13:51:24,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-24 13:51:24,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-12-24 13:51:24,706 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2018-12-24 13:51:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:25,528 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-24 13:51:25,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 13:51:25,528 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2018-12-24 13:51:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:25,529 INFO L225 Difference]: With dead ends: 79 [2018-12-24 13:51:25,529 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 13:51:25,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2018-12-24 13:51:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 13:51:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-24 13:51:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:51:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-24 13:51:25,595 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2018-12-24 13:51:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:25,596 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-24 13:51:25,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-24 13:51:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-24 13:51:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-24 13:51:25,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:25,597 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-24 13:51:25,597 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:25,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2018-12-24 13:51:25,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:25,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:25,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:28,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:28,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:28,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:28,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:28,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:28,347 INFO 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 [2018-12-24 13:51:28,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:28,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:28,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:28,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:28,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:31,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:51:31,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:31,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:31,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:51:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 13:51:31,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:32,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:51:32,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:32,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:32,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:51:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 13:51:35,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:35,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2018-12-24 13:51:35,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:35,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-24 13:51:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-24 13:51:35,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 13:51:35,925 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2018-12-24 13:51:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:45,185 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-12-24 13:51:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-24 13:51:45,185 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2018-12-24 13:51:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:45,186 INFO L225 Difference]: With dead ends: 119 [2018-12-24 13:51:45,186 INFO L226 Difference]: Without dead ends: 79 [2018-12-24 13:51:45,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 13:51:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-24 13:51:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-24 13:51:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 13:51:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-24 13:51:45,254 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-24 13:51:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:45,254 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-24 13:51:45,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-24 13:51:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-24 13:51:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-24 13:51:45,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:45,255 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-24 13:51:45,255 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2018-12-24 13:51:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:48,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:48,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:48,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:48,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:48,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:48,907 INFO 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 [2018-12-24 13:51:48,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:48,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:48,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:52,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:51:52,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:52,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:52,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:51:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:52,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:52,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:51:52,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:52,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:52,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:51:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:53,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:53,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2018-12-24 13:51:53,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:53,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-24 13:51:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-24 13:51:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 13:51:53,950 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2018-12-24 13:52:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:02,009 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-12-24 13:52:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 13:52:02,010 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2018-12-24 13:52:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:02,011 INFO L225 Difference]: With dead ends: 120 [2018-12-24 13:52:02,011 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 13:52:02,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:52:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 13:52:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-24 13:52:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-24 13:52:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-12-24 13:52:02,072 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2018-12-24 13:52:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:02,072 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-12-24 13:52:02,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-24 13:52:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-12-24 13:52:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-24 13:52:02,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:02,073 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2018-12-24 13:52:02,073 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2018-12-24 13:52:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:02,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:02,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:02,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:02,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:02,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:02,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:52:02,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:02,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:03,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-24 13:52:03,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:03,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:03,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-24 13:52:04,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:04,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-24 13:52:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-24 13:52:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 13:52:04,355 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2018-12-24 13:52:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:05,137 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-12-24 13:52:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 13:52:05,138 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2018-12-24 13:52:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:05,139 INFO L225 Difference]: With dead ends: 83 [2018-12-24 13:52:05,139 INFO L226 Difference]: Without dead ends: 81 [2018-12-24 13:52:05,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2018-12-24 13:52:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-24 13:52:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-24 13:52:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 13:52:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-24 13:52:05,196 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2018-12-24 13:52:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:05,196 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-24 13:52:05,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-24 13:52:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-24 13:52:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 13:52:05,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:05,197 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-24 13:52:05,197 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2018-12-24 13:52:05,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:05,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:05,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:08,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:08,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:08,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:08,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:08,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:08,877 INFO 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 [2018-12-24 13:52:08,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:08,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:08,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:08,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:08,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:13,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:52:13,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:52:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 13:52:13,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:13,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:52:13,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:13,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:52:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 13:52:18,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:18,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2018-12-24 13:52:18,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:18,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-24 13:52:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-24 13:52:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:52:18,407 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2018-12-24 13:52:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:28,026 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-24 13:52:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-24 13:52:28,027 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2018-12-24 13:52:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:28,028 INFO L225 Difference]: With dead ends: 125 [2018-12-24 13:52:28,028 INFO L226 Difference]: Without dead ends: 83 [2018-12-24 13:52:28,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 13:52:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-24 13:52:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-24 13:52:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-24 13:52:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-24 13:52:28,098 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-24 13:52:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:28,099 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-24 13:52:28,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-24 13:52:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-24 13:52:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-24 13:52:28,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:28,099 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-24 13:52:28,099 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2018-12-24 13:52:28,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:28,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:28,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:32,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:32,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:32,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:32,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:32,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:32,400 INFO 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 [2018-12-24 13:52:32,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:32,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:32,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:36,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:52:36,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:52:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:36,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:36,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:52:36,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:52:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:38,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:38,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2018-12-24 13:52:38,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:38,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-24 13:52:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-24 13:52:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 13:52:38,010 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2018-12-24 13:52:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:46,575 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-12-24 13:52:46,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 13:52:46,575 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2018-12-24 13:52:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:46,576 INFO L225 Difference]: With dead ends: 126 [2018-12-24 13:52:46,576 INFO L226 Difference]: Without dead ends: 84 [2018-12-24 13:52:46,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:52:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-24 13:52:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-24 13:52:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-24 13:52:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-24 13:52:46,636 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2018-12-24 13:52:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:46,636 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-24 13:52:46,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-24 13:52:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-24 13:52:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-24 13:52:46,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:46,637 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2018-12-24 13:52:46,637 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2018-12-24 13:52:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:46,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:46,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:47,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:47,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:47,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:47,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:47,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:47,694 INFO 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 [2018-12-24 13:52:47,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:47,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:47,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-24 13:52:47,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:47,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:48,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:49,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:49,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-24 13:52:49,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:49,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-24 13:52:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-24 13:52:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-12-24 13:52:49,224 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2018-12-24 13:52:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:50,043 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-24 13:52:50,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 13:52:50,043 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2018-12-24 13:52:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:50,044 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:52:50,044 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 13:52:50,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 13:52:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 13:52:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-24 13:52:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 13:52:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-24 13:52:50,105 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-24 13:52:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:50,105 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-24 13:52:50,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-24 13:52:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-24 13:52:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 13:52:50,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:50,106 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-24 13:52:50,106 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2018-12-24 13:52:50,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:50,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:50,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:53,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:53,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:53,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:53,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:53,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:53,657 INFO 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 [2018-12-24 13:52:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:53,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:53,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:53,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:53,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:57,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:52:57,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:57,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:57,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:52:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 13:52:57,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:58,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:52:58,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:58,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:58,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:53:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 13:53:03,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:03,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2018-12-24 13:53:03,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:03,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-24 13:53:03,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-24 13:53:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:53:03,020 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2018-12-24 13:53:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:13,924 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-12-24 13:53:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-24 13:53:13,925 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2018-12-24 13:53:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:13,925 INFO L225 Difference]: With dead ends: 131 [2018-12-24 13:53:13,926 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 13:53:13,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2018-12-24 13:53:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 13:53:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-24 13:53:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-24 13:53:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-24 13:53:13,997 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-24 13:53:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:13,997 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-24 13:53:13,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-24 13:53:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-24 13:53:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-24 13:53:13,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:13,998 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-24 13:53:13,998 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:13,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2018-12-24 13:53:13,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:13,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:13,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:17,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:17,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:17,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:17,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:17,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:17,473 INFO 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 [2018-12-24 13:53:17,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:17,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:17,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:21,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:53:21,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:21,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:21,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:53:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:21,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:21,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:53:21,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:21,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:21,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:53:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:23,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:23,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2018-12-24 13:53:23,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:23,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-24 13:53:23,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-24 13:53:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 13:53:23,731 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2018-12-24 13:53:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:32,898 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-24 13:53:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 13:53:32,898 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2018-12-24 13:53:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:32,899 INFO L225 Difference]: With dead ends: 132 [2018-12-24 13:53:32,899 INFO L226 Difference]: Without dead ends: 88 [2018-12-24 13:53:32,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:53:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-24 13:53:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-24 13:53:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-24 13:53:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-24 13:53:32,971 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-24 13:53:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:32,971 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-24 13:53:32,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-24 13:53:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-24 13:53:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-24 13:53:32,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:32,972 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2018-12-24 13:53:32,972 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2018-12-24 13:53:32,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:32,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:34,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:34,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:34,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:34,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:34,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:34,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:34,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:34,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:34,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-24 13:53:34,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:34,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:34,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:35,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:35,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-24 13:53:35,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:35,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-24 13:53:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-24 13:53:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-12-24 13:53:35,858 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2018-12-24 13:53:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:36,757 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-12-24 13:53:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 13:53:36,758 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2018-12-24 13:53:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:36,758 INFO L225 Difference]: With dead ends: 91 [2018-12-24 13:53:36,759 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 13:53:36,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2018-12-24 13:53:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 13:53:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-24 13:53:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-24 13:53:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-24 13:53:36,877 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2018-12-24 13:53:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:36,877 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-24 13:53:36,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-24 13:53:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-24 13:53:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-24 13:53:36,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:36,879 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-24 13:53:36,879 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2018-12-24 13:53:36,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:36,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:36,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:40,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:40,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:40,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:40,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:40,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:40,893 INFO 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 [2018-12-24 13:53:40,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:40,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:40,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:40,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:40,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:45,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:53:45,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:53:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 13:53:45,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:45,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:53:45,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:53:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 13:53:51,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:51,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2018-12-24 13:53:51,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:51,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-24 13:53:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-24 13:53:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:53:51,345 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2018-12-24 13:54:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:03,424 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-12-24 13:54:03,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-24 13:54:03,425 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2018-12-24 13:54:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:03,425 INFO L225 Difference]: With dead ends: 137 [2018-12-24 13:54:03,425 INFO L226 Difference]: Without dead ends: 91 [2018-12-24 13:54:03,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2018-12-24 13:54:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-24 13:54:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-24 13:54:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 13:54:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-24 13:54:03,493 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-24 13:54:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:03,494 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-24 13:54:03,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-24 13:54:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-24 13:54:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 13:54:03,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:03,494 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-24 13:54:03,495 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2018-12-24 13:54:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:03,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:03,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:07,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:07,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:07,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:07,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:07,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:07,439 INFO 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 [2018-12-24 13:54:07,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:07,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:07,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:12,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:54:12,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:54:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:12,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:12,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:54:12,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:54:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:13,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:13,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2018-12-24 13:54:13,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:13,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-24 13:54:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-24 13:54:13,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 13:54:13,963 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2018-12-24 13:54:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:24,183 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-12-24 13:54:24,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 13:54:24,183 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2018-12-24 13:54:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:24,184 INFO L225 Difference]: With dead ends: 138 [2018-12-24 13:54:24,184 INFO L226 Difference]: Without dead ends: 92 [2018-12-24 13:54:24,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-24 13:54:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-24 13:54:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-24 13:54:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-12-24 13:54:24,256 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2018-12-24 13:54:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:24,256 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-12-24 13:54:24,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-24 13:54:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-12-24 13:54:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-24 13:54:24,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:24,257 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2018-12-24 13:54:24,257 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:24,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2018-12-24 13:54:24,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:24,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:24,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:25,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:25,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:25,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:25,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:25,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:25,367 INFO 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 [2018-12-24 13:54:25,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:25,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:25,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-24 13:54:25,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:25,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:25,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:27,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:27,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-24 13:54:27,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:27,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-24 13:54:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-24 13:54:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 13:54:27,244 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2018-12-24 13:54:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:28,229 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-12-24 13:54:28,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 13:54:28,229 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-12-24 13:54:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:28,230 INFO L225 Difference]: With dead ends: 95 [2018-12-24 13:54:28,230 INFO L226 Difference]: Without dead ends: 93 [2018-12-24 13:54:28,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2018-12-24 13:54:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-24 13:54:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-24 13:54:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 13:54:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-24 13:54:28,302 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2018-12-24 13:54:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:28,302 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-24 13:54:28,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-24 13:54:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-24 13:54:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-24 13:54:28,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:28,303 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-24 13:54:28,303 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:28,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:28,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2018-12-24 13:54:28,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:28,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:28,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:28,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:28,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:32,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:32,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:32,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:32,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:32,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:32,632 INFO 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 [2018-12-24 13:54:32,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:32,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:32,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:32,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:32,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:37,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:54:37,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:37,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:37,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:54:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 13:54:37,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:37,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:54:37,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:37,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:37,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:54:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 13:54:43,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:43,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2018-12-24 13:54:43,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:43,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-24 13:54:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-24 13:54:43,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:43,829 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2018-12-24 13:54:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:56,625 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-24 13:54:56,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-12-24 13:54:56,625 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2018-12-24 13:54:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:56,626 INFO L225 Difference]: With dead ends: 143 [2018-12-24 13:54:56,626 INFO L226 Difference]: Without dead ends: 95 [2018-12-24 13:54:56,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2018-12-24 13:54:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-24 13:54:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-24 13:54:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-24 13:54:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-24 13:54:56,714 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-24 13:54:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:56,714 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-24 13:54:56,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-24 13:54:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-24 13:54:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-24 13:54:56,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:56,715 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-24 13:54:56,715 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2018-12-24 13:54:56,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:56,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:56,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:01,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:01,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:01,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:01,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:01,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:01,185 INFO 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 [2018-12-24 13:55:01,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:01,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:01,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:06,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:55:06,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:55:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:06,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:06,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:55:06,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:55:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:08,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:08,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2018-12-24 13:55:08,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:08,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-24 13:55:08,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-24 13:55:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 13:55:08,355 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2018-12-24 13:55:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:19,386 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-12-24 13:55:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 13:55:19,386 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2018-12-24 13:55:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:19,387 INFO L225 Difference]: With dead ends: 144 [2018-12-24 13:55:19,387 INFO L226 Difference]: Without dead ends: 96 [2018-12-24 13:55:19,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:55:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-24 13:55:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-24 13:55:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-24 13:55:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-24 13:55:19,473 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2018-12-24 13:55:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:19,473 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-24 13:55:19,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-24 13:55:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-24 13:55:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-24 13:55:19,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:19,474 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2018-12-24 13:55:19,474 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2018-12-24 13:55:19,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:19,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:19,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:20,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:20,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:20,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:20,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:20,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:20,388 INFO 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 [2018-12-24 13:55:20,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:20,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:20,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-24 13:55:20,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:20,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:20,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:22,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:22,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-24 13:55:22,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:22,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-24 13:55:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-24 13:55:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-12-24 13:55:22,665 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2018-12-24 13:55:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:23,707 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-24 13:55:23,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 13:55:23,708 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2018-12-24 13:55:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:23,708 INFO L225 Difference]: With dead ends: 99 [2018-12-24 13:55:23,709 INFO L226 Difference]: Without dead ends: 97 [2018-12-24 13:55:23,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 13:55:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-24 13:55:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-24 13:55:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 13:55:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-24 13:55:23,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-24 13:55:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:23,785 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-24 13:55:23,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-24 13:55:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-24 13:55:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 13:55:23,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:23,785 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-24 13:55:23,785 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:23,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:23,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2018-12-24 13:55:23,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:23,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:23,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:28,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:28,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:28,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:28,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:28,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:28,313 INFO 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 [2018-12-24 13:55:28,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:55:28,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:55:28,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:55:28,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:28,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:33,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:55:33,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:55:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 13:55:34,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:34,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:55:34,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:34,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:34,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:55:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 13:55:40,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:40,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2018-12-24 13:55:40,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:40,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-12-24 13:55:40,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-12-24 13:55:40,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:55:40,448 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2018-12-24 13:55:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:54,738 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-12-24 13:55:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-12-24 13:55:54,738 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2018-12-24 13:55:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:54,739 INFO L225 Difference]: With dead ends: 149 [2018-12-24 13:55:54,739 INFO L226 Difference]: Without dead ends: 99 [2018-12-24 13:55:54,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2018-12-24 13:55:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-24 13:55:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-24 13:55:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-24 13:55:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-24 13:55:54,820 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-24 13:55:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:54,821 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-24 13:55:54,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-12-24 13:55:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-24 13:55:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-24 13:55:54,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:54,821 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-24 13:55:54,821 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2018-12-24 13:55:54,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:54,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:54,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:54,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:54,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:59,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:59,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:59,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:59,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:59,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:59,438 INFO 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 [2018-12-24 13:55:59,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:59,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:59,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:04,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:56:04,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:56:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:04,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:05,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:56:05,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:56:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:07,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2018-12-24 13:56:07,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:07,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-24 13:56:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-24 13:56:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 13:56:07,282 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2018-12-24 13:56:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:18,141 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-12-24 13:56:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 13:56:18,142 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2018-12-24 13:56:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:18,143 INFO L225 Difference]: With dead ends: 150 [2018-12-24 13:56:18,143 INFO L226 Difference]: Without dead ends: 100 [2018-12-24 13:56:18,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:56:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-24 13:56:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-24 13:56:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-24 13:56:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-24 13:56:18,226 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-24 13:56:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:18,226 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-24 13:56:18,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-24 13:56:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-24 13:56:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-24 13:56:18,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:18,227 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2018-12-24 13:56:18,227 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:18,227 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2018-12-24 13:56:18,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:18,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:19,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:19,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:19,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:19,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:19,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:19,233 INFO 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 [2018-12-24 13:56:19,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:19,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:19,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-24 13:56:19,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:19,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:19,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:21,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:21,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-24 13:56:21,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:21,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-24 13:56:21,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-24 13:56:21,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-12-24 13:56:21,537 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2018-12-24 13:56:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:22,842 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-12-24 13:56:22,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 13:56:22,843 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-12-24 13:56:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:22,843 INFO L225 Difference]: With dead ends: 103 [2018-12-24 13:56:22,843 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 13:56:22,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2018-12-24 13:56:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 13:56:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-24 13:56:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 13:56:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-24 13:56:22,929 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2018-12-24 13:56:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:22,929 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-24 13:56:22,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-24 13:56:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-24 13:56:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 13:56:22,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:22,930 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-24 13:56:22,930 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:22,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2018-12-24 13:56:22,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:22,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:22,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:22,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:22,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:27,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:27,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:27,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:27,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:27,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:27,768 INFO 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 [2018-12-24 13:56:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:27,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:27,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:27,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:27,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:33,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:56:33,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:33,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:33,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:56:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 13:56:33,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:34,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:56:34,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:56:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 13:56:40,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:40,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2018-12-24 13:56:40,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:40,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-12-24 13:56:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-12-24 13:56:40,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:56:40,925 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2018-12-24 13:56:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:56,220 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-12-24 13:56:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-12-24 13:56:56,220 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2018-12-24 13:56:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:56,221 INFO L225 Difference]: With dead ends: 155 [2018-12-24 13:56:56,221 INFO L226 Difference]: Without dead ends: 103 [2018-12-24 13:56:56,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2018-12-24 13:56:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-24 13:56:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-24 13:56:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 13:56:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-24 13:56:56,311 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-24 13:56:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:56,311 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-24 13:56:56,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-12-24 13:56:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-24 13:56:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-24 13:56:56,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:56,312 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-24 13:56:56,312 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2018-12-24 13:56:56,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:56,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:56,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:56,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:56,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:01,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:01,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:01,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:01,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:01,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:01,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 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 [2018-12-24 13:57:01,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:01,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:01,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:07,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:57:07,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:07,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:07,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:57:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:07,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:07,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:57:07,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:07,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:07,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:57:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:09,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:09,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2018-12-24 13:57:09,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:09,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-24 13:57:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-24 13:57:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:57:09,977 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2018-12-24 13:57:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:21,669 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-12-24 13:57:21,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-24 13:57:21,670 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2018-12-24 13:57:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:21,671 INFO L225 Difference]: With dead ends: 156 [2018-12-24 13:57:21,671 INFO L226 Difference]: Without dead ends: 104 [2018-12-24 13:57:21,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 13:57:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-24 13:57:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-24 13:57:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-24 13:57:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-12-24 13:57:21,755 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2018-12-24 13:57:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:21,755 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-12-24 13:57:21,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-24 13:57:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-12-24 13:57:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-24 13:57:21,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:21,755 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2018-12-24 13:57:21,756 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2018-12-24 13:57:21,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:21,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:21,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:22,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:22,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:22,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:22,818 INFO 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 [2018-12-24 13:57:22,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:22,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:23,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-24 13:57:23,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:23,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:23,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:25,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:25,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-24 13:57:25,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:25,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-24 13:57:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-24 13:57:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 13:57:25,658 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2018-12-24 13:57:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:26,902 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-12-24 13:57:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 13:57:26,902 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2018-12-24 13:57:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:26,903 INFO L225 Difference]: With dead ends: 107 [2018-12-24 13:57:26,903 INFO L226 Difference]: Without dead ends: 105 [2018-12-24 13:57:26,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2018-12-24 13:57:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-24 13:57:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-24 13:57:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-24 13:57:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-24 13:57:27,000 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2018-12-24 13:57:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:27,000 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-24 13:57:27,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-24 13:57:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-24 13:57:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-24 13:57:27,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:27,001 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-24 13:57:27,001 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2018-12-24 13:57:27,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:27,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:27,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:32,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:32,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:32,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:32,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:32,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:32,212 INFO 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 [2018-12-24 13:57:32,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:57:32,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:57:32,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:57:32,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:32,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:38,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:57:38,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:38,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:38,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:57:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 13:57:38,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:38,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:57:38,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:38,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:38,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:57:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 13:57:46,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:46,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2018-12-24 13:57:46,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:46,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-24 13:57:46,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-24 13:57:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 13:57:46,362 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2018-12-24 13:58:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:01,741 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-24 13:58:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-12-24 13:58:01,742 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2018-12-24 13:58:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:01,743 INFO L225 Difference]: With dead ends: 161 [2018-12-24 13:58:01,743 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 13:58:01,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2018-12-24 13:58:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 13:58:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-24 13:58:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-24 13:58:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-24 13:58:01,854 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-24 13:58:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:01,854 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-24 13:58:01,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-24 13:58:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-24 13:58:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-24 13:58:01,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:01,854 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-24 13:58:01,855 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2018-12-24 13:58:01,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:01,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:01,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:01,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:07,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:07,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:07,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:07,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:07,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:07,418 INFO 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 [2018-12-24 13:58:07,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:07,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:07,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:13,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:58:13,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:58:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:13,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:13,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:58:13,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:58:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:16,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2018-12-24 13:58:16,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:16,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-24 13:58:16,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-24 13:58:16,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:58:16,635 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2018-12-24 13:58:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:28,616 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-24 13:58:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-24 13:58:28,616 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2018-12-24 13:58:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:28,617 INFO L225 Difference]: With dead ends: 162 [2018-12-24 13:58:28,617 INFO L226 Difference]: Without dead ends: 108 [2018-12-24 13:58:28,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2018-12-24 13:58:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-24 13:58:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-24 13:58:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-24 13:58:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-24 13:58:28,714 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2018-12-24 13:58:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:28,714 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-24 13:58:28,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-24 13:58:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-24 13:58:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-24 13:58:28,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:28,714 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2018-12-24 13:58:28,715 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2018-12-24 13:58:28,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:28,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:28,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:28,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:28,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:29,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:29,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:29,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:29,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:29,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:29,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 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 [2018-12-24 13:58:29,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:58:29,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:58:30,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-24 13:58:30,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:30,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:30,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:32,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:32,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-24 13:58:32,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:32,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-24 13:58:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-24 13:58:32,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-12-24 13:58:32,626 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2018-12-24 13:58:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:33,909 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-24 13:58:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-24 13:58:33,910 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2018-12-24 13:58:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:33,910 INFO L225 Difference]: With dead ends: 111 [2018-12-24 13:58:33,910 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 13:58:33,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 13:58:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 13:58:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-24 13:58:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 13:58:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-24 13:58:34,010 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-24 13:58:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:34,010 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-24 13:58:34,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-24 13:58:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-24 13:58:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 13:58:34,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:34,010 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-24 13:58:34,011 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2018-12-24 13:58:34,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:34,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:34,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:34,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:39,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:39,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:39,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:39,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:39,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:39,572 INFO 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 [2018-12-24 13:58:39,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:58:39,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:58:39,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:58:39,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:39,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:46,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:58:46,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-24 13:58:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 13:58:46,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:46,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:58:46,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-24 13:58:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 13:58:54,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:54,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2018-12-24 13:58:54,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:54,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-12-24 13:58:54,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-12-24 13:58:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2018-12-24 13:58:54,986 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2018-12-24 13:59:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:11,991 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-12-24 13:59:11,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-12-24 13:59:11,991 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2018-12-24 13:59:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:11,993 INFO L225 Difference]: With dead ends: 167 [2018-12-24 13:59:11,993 INFO L226 Difference]: Without dead ends: 111 [2018-12-24 13:59:11,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2018-12-24 13:59:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-24 13:59:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-24 13:59:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 13:59:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-24 13:59:12,096 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-24 13:59:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:12,096 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-24 13:59:12,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-12-24 13:59:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-24 13:59:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-24 13:59:12,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:12,097 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-24 13:59:12,097 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:12,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:12,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2018-12-24 13:59:12,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:12,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:12,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:12,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:17,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:17,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:17,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:17,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:17,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:17,841 INFO 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 [2018-12-24 13:59:17,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:17,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:17,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:24,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-24 13:59:24,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:24,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:24,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-24 13:59:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:24,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:24,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-24 13:59:24,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:24,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:24,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-24 13:59:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:27,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:27,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2018-12-24 13:59:27,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:27,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-24 13:59:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-24 13:59:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:59:27,675 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states. [2018-12-24 13:59:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:41,045 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-12-24 13:59:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-24 13:59:41,045 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 110 [2018-12-24 13:59:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:41,046 INFO L225 Difference]: With dead ends: 168 [2018-12-24 13:59:41,046 INFO L226 Difference]: Without dead ends: 112 [2018-12-24 13:59:41,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 122 SyntacticMatches, 41 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8226 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=1042, Invalid=48020, Unknown=0, NotChecked=0, Total=49062 [2018-12-24 13:59:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-24 13:59:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-24 13:59:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-24 13:59:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-24 13:59:41,150 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-24 13:59:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:41,150 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-24 13:59:41,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-24 13:59:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-24 13:59:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-24 13:59:41,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:41,151 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1] [2018-12-24 13:59:41,151 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:41,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1280933780, now seen corresponding path program 80 times [2018-12-24 13:59:41,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:41,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:41,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:42,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:42,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:42,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:42,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:42,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:42,706 INFO 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 [2018-12-24 13:59:42,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:59:42,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:59:43,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-24 13:59:43,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:43,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:43,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:45,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:45,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-24 13:59:45,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:45,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-24 13:59:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-24 13:59:45,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-12-24 13:59:45,660 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 57 states. [2018-12-24 13:59:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:46,988 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-12-24 13:59:46,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-24 13:59:46,989 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2018-12-24 13:59:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:46,989 INFO L225 Difference]: With dead ends: 115 [2018-12-24 13:59:46,989 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 13:59:46,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 167 SyntacticMatches, 108 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2018-12-24 13:59:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 13:59:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-24 13:59:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 13:59:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-24 13:59:47,097 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 111 [2018-12-24 13:59:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:47,097 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-24 13:59:47,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-24 13:59:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-24 13:59:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-24 13:59:47,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:47,098 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-24 13:59:47,098 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 81 times [2018-12-24 13:59:47,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:47,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:47,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat