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-b7bd044-m [2019-01-20 09:57:21,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:21,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:21,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:21,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:21,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:21,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:21,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:21,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:21,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:21,652 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:21,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:21,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:21,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:21,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:21,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:21,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:21,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:21,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:21,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:21,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:21,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:21,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:21,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:21,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:21,684 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:21,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:21,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:21,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:21,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:21,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:21,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:21,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:21,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:21,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:21,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:21,694 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 09:57:21,717 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:21,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:21,718 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:21,718 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:21,718 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:21,718 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:21,719 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:21,719 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:21,719 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:21,719 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:21,719 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:21,720 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:21,720 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:21,720 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:21,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:21,721 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:21,721 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:21,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:21,721 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:21,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:21,722 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:21,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:21,722 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:21,722 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:21,722 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:21,723 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:21,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:21,723 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:21,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:21,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:21,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:21,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:21,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:21,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:21,724 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:21,725 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:21,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:21,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:21,725 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:21,725 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:21,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:21,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:21,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:21,776 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:21,776 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:21,777 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 [2019-01-20 09:57:21,778 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-01-20 09:57:21,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:21,831 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:21,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:21,832 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:21,849 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,863 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:21,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:21,887 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,888 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,889 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,889 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,894 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,897 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,899 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:21,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:21,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:21,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 09:57:21,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 09:57:22,233 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 09:57:22,234 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-20 09:57:22,235 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:22 BoogieIcfgContainer [2019-01-20 09:57:22,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:22,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:22,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:22,240 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:22,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/2) ... [2019-01-20 09:57:22,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ca8e6b and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:22, skipping insertion in model container [2019-01-20 09:57:22,241 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 20.01 09:57:22" (2/2) ... [2019-01-20 09:57:22,243 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-01-20 09:57:22,253 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:22,261 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 09:57:22,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 09:57:22,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:22,311 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:22,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:22,312 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:22,312 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:22,312 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:22,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:22,313 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-20 09:57:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 09:57:22,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 09:57:22,346 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-20 09:57:22,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:22,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:22,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 09:57:22,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:22,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:22,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:22,545 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-20 09:57:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:22,666 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-20 09:57:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:22,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 09:57:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:22,682 INFO L225 Difference]: With dead ends: 10 [2019-01-20 09:57:22,682 INFO L226 Difference]: Without dead ends: 6 [2019-01-20 09:57:22,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-20 09:57:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-20 09:57:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-20 09:57:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-20 09:57:22,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-20 09:57:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:22,715 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-20 09:57:22,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-20 09:57:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 09:57:22,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 09:57:22,717 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,717 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-20 09:57:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:22,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 09:57:22,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:22,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 09:57:22,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 09:57:22,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 09:57:22,919 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-20 09:57:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,061 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-20 09:57:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 09:57:23,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 09:57:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,064 INFO L225 Difference]: With dead ends: 11 [2019-01-20 09:57:23,064 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 09:57:23,065 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 [2019-01-20 09:57:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 09:57:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 09:57:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 09:57:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-20 09:57:23,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-20 09:57:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,069 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-20 09:57:23,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 09:57:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-20 09:57:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 09:57:23,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 09:57:23,071 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-20 09:57:23,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:23,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:23,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 09:57:23,421 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-20 09:57:23,461 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:23,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:23,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:23,635 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. [2019-01-20 09:57:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:23,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:23,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:24,102 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 [2019-01-20 09:57:24,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:24,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:24,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,204 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 [2019-01-20 09:57:24,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:24,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:24,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:57:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-20 09:57:24,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 09:57:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 09:57:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-20 09:57:24,381 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-01-20 09:57:24,578 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-20 09:57:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:24,816 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-20 09:57:24,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 09:57:24,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 09:57:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:24,818 INFO L225 Difference]: With dead ends: 12 [2019-01-20 09:57:24,818 INFO L226 Difference]: Without dead ends: 8 [2019-01-20 09:57:24,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-20 09:57:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-20 09:57:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 09:57:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-20 09:57:24,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-01-20 09:57:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:24,823 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-20 09:57:24,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 09:57:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-20 09:57:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 09:57:24,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:24,824 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 09:57:24,825 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:24,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:24,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-01-20 09:57:24,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:24,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:24,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:24,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:24,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:24,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:24,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:24,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 09:57:24,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:24,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-01-20 09:57:24,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 09:57:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 09:57:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 09:57:24,988 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-01-20 09:57:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,332 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-20 09:57:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:25,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-20 09:57:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,335 INFO L225 Difference]: With dead ends: 11 [2019-01-20 09:57:25,335 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 09:57:25,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-20 09:57:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 09:57:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 09:57:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 09:57:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-20 09:57:25,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-01-20 09:57:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,340 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-20 09:57:25,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 09:57:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-20 09:57:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 09:57:25,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,341 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-20 09:57:25,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-01-20 09:57:25,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:25,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:25,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:25,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:25,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:25,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,663 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 [2019-01-20 09:57:25,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:25,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:25,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:57:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 09:57:25,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:25,772 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 [2019-01-20 09:57:25,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:25,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:25,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:57:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 09:57:25,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:25,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-01-20 09:57:25,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:25,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 09:57:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 09:57:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:25,957 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-01-20 09:57:26,287 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-20 09:57:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:26,527 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-20 09:57:26,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 09:57:26,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 09:57:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:26,528 INFO L225 Difference]: With dead ends: 17 [2019-01-20 09:57:26,528 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 09:57:26,529 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 [2019-01-20 09:57:26,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 09:57:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 09:57:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-20 09:57:26,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-20 09:57:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:26,534 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-20 09:57:26,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 09:57:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-20 09:57:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 09:57:26,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:26,535 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-20 09:57:26,536 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-01-20 09:57:26,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:26,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:26,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:26,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:26,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:26,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:26,882 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 [2019-01-20 09:57:26,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:26,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:26,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:26,929 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 [2019-01-20 09:57:26,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:26,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:26,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:57:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:27,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:27,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-01-20 09:57:27,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:27,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 09:57:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 09:57:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-20 09:57:27,014 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-01-20 09:57:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:27,406 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-20 09:57:27,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 09:57:27,406 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-20 09:57:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:27,407 INFO L225 Difference]: With dead ends: 18 [2019-01-20 09:57:27,407 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 09:57:27,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 09:57:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 09:57:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 09:57:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-20 09:57:27,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-01-20 09:57:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:27,413 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-20 09:57:27,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 09:57:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-20 09:57:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 09:57:27,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:27,413 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-01-20 09:57:27,413 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-01-20 09:57:27,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:27,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:27,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:27,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:27,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:27,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:27,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:27,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 09:57:27,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:27,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:27,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:27,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:27,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-20 09:57:27,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:27,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 09:57:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 09:57:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-20 09:57:27,737 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-01-20 09:57:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:27,806 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-20 09:57:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:57:27,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-20 09:57:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:27,808 INFO L225 Difference]: With dead ends: 15 [2019-01-20 09:57:27,808 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 09:57:27,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 09:57:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-20 09:57:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 09:57:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-20 09:57:27,813 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-01-20 09:57:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:27,814 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-20 09:57:27,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 09:57:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-20 09:57:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 09:57:27,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:27,815 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-20 09:57:27,815 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-01-20 09:57:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:28,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:28,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:28,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:28,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:28,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:28,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:28,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:28,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:28,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:28,163 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 [2019-01-20 09:57:28,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:28,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:28,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:57:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 09:57:28,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:28,240 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 [2019-01-20 09:57:28,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:28,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:28,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:57:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 09:57:28,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:28,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-01-20 09:57:28,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:28,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 09:57:28,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 09:57:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:28,378 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-01-20 09:57:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:29,148 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-20 09:57:29,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 09:57:29,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-20 09:57:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:29,148 INFO L225 Difference]: With dead ends: 23 [2019-01-20 09:57:29,148 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 09:57:29,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-01-20 09:57:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 09:57:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 09:57:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 09:57:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-20 09:57:29,155 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-20 09:57:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:29,155 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-20 09:57:29,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 09:57:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-20 09:57:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-20 09:57:29,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:29,156 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-20 09:57:29,156 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:29,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-01-20 09:57:29,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:29,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:29,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:29,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:29,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:29,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:29,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:29,687 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 [2019-01-20 09:57:29,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:29,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:29,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:29,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:29,734 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 [2019-01-20 09:57:29,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:29,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:29,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:57:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:29,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-01-20 09:57:29,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:29,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 09:57:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 09:57:29,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:29,784 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-01-20 09:57:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:30,532 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-20 09:57:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 09:57:30,533 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-20 09:57:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:30,534 INFO L225 Difference]: With dead ends: 24 [2019-01-20 09:57:30,534 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 09:57:30,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 09:57:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-20 09:57:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 09:57:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-20 09:57:30,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-01-20 09:57:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:30,541 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-20 09:57:30,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 09:57:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-20 09:57:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-20 09:57:30,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:30,542 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-01-20 09:57:30,542 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-01-20 09:57:30,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:30,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:30,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:30,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:30,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:30,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:30,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:30,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:30,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:30,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 09:57:30,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:30,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:30,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:31,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:31,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-01-20 09:57:31,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:31,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 09:57:31,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 09:57:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-20 09:57:31,045 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-20 09:57:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:31,315 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-20 09:57:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 09:57:31,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-20 09:57:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:31,317 INFO L225 Difference]: With dead ends: 19 [2019-01-20 09:57:31,317 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 09:57:31,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-20 09:57:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 09:57:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 09:57:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 09:57:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-20 09:57:31,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-20 09:57:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:31,323 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-20 09:57:31,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 09:57:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-20 09:57:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 09:57:31,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:31,324 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-20 09:57:31,325 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-01-20 09:57:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:31,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:31,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:31,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:31,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:31,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:31,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:31,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:31,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:31,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:31,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:31,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:31,883 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 [2019-01-20 09:57:31,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:31,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:31,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:57:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 09:57:31,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:31,974 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 [2019-01-20 09:57:31,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:31,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:31,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:57:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 09:57:32,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:32,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-01-20 09:57:32,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:32,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 09:57:32,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 09:57:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:32,181 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-01-20 09:57:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:33,071 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-20 09:57:33,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 09:57:33,072 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-20 09:57:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:33,073 INFO L225 Difference]: With dead ends: 29 [2019-01-20 09:57:33,073 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 09:57:33,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 09:57:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 09:57:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-20 09:57:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 09:57:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-20 09:57:33,080 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-20 09:57:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:33,081 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-20 09:57:33,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 09:57:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-20 09:57:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-20 09:57:33,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:33,082 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-20 09:57:33,082 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-01-20 09:57:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:33,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:33,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:33,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:33,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:33,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:33,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:33,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:33,700 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 [2019-01-20 09:57:33,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:33,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:33,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:33,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:33,771 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 [2019-01-20 09:57:33,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:33,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:33,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:57:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:34,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-01-20 09:57:34,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:34,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 09:57:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 09:57:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-01-20 09:57:34,002 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-01-20 09:57:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:34,749 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-20 09:57:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 09:57:34,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-20 09:57:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:34,750 INFO L225 Difference]: With dead ends: 30 [2019-01-20 09:57:34,751 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 09:57:34,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 09:57:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-20 09:57:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 09:57:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-20 09:57:34,759 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-01-20 09:57:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:34,759 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-20 09:57:34,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 09:57:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-20 09:57:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-20 09:57:34,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:34,760 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-01-20 09:57:34,760 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-01-20 09:57:34,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:34,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:34,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:34,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:34,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:34,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:34,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:34,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:34,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:34,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 09:57:34,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:34,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:35,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-01-20 09:57:35,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:35,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 09:57:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 09:57:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:35,292 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-01-20 09:57:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:35,850 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-20 09:57:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 09:57:35,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-20 09:57:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:35,852 INFO L225 Difference]: With dead ends: 23 [2019-01-20 09:57:35,852 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 09:57:35,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-20 09:57:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 09:57:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-20 09:57:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 09:57:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-20 09:57:35,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-01-20 09:57:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:35,859 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-20 09:57:35,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 09:57:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-20 09:57:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 09:57:35,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:35,860 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-20 09:57:35,860 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-01-20 09:57:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:35,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:35,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:36,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:36,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:36,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:36,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:36,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:36,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:36,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:36,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:36,969 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 [2019-01-20 09:57:36,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:36,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:36,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:57:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 09:57:37,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:37,113 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 [2019-01-20 09:57:37,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:37,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:37,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:57:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 09:57:37,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:37,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-01-20 09:57:37,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:37,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 09:57:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 09:57:37,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:37,426 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-01-20 09:57:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,538 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-20 09:57:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 09:57:38,539 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-20 09:57:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,540 INFO L225 Difference]: With dead ends: 35 [2019-01-20 09:57:38,540 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 09:57:38,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-01-20 09:57:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 09:57:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-20 09:57:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 09:57:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-20 09:57:38,549 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-20 09:57:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,550 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-20 09:57:38,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 09:57:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-20 09:57:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-20 09:57:38,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,551 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-20 09:57:38,551 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,551 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-01-20 09:57:38,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:38,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:39,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:39,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:39,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:39,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:39,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:39,612 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 [2019-01-20 09:57:39,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:39,671 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 [2019-01-20 09:57:39,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:57:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:39,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-01-20 09:57:39,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:39,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 09:57:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 09:57:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:39,885 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-01-20 09:57:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:40,718 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-20 09:57:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 09:57:40,718 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-20 09:57:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:40,719 INFO L225 Difference]: With dead ends: 36 [2019-01-20 09:57:40,720 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 09:57:40,721 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 [2019-01-20 09:57:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 09:57:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-20 09:57:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 09:57:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-20 09:57:40,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-01-20 09:57:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:40,729 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-20 09:57:40,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 09:57:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-20 09:57:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 09:57:40,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:40,730 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-01-20 09:57:40,730 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-01-20 09:57:40,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:40,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:40,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:40,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:40,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:40,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:40,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 09:57:40,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:40,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:41,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-01-20 09:57:41,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:41,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 09:57:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 09:57:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-20 09:57:41,089 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-01-20 09:57:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,214 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-20 09:57:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 09:57:41,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-20 09:57:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,215 INFO L225 Difference]: With dead ends: 27 [2019-01-20 09:57:41,215 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 09:57:41,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-20 09:57:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 09:57:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-20 09:57:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 09:57:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-20 09:57:41,226 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-01-20 09:57:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:41,226 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-20 09:57:41,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 09:57:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-20 09:57:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 09:57:41,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:41,227 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-20 09:57:41,227 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-01-20 09:57:41,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:41,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:41,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:41,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:41,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:41,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:41,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:41,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:41,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:42,216 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 [2019-01-20 09:57:42,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:57:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 09:57:42,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:42,314 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 [2019-01-20 09:57:42,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:57:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 09:57:42,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:42,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-01-20 09:57:42,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:42,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 09:57:42,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 09:57:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:42,713 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-01-20 09:57:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:44,541 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-20 09:57:44,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 09:57:44,542 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-20 09:57:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:44,543 INFO L225 Difference]: With dead ends: 41 [2019-01-20 09:57:44,543 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 09:57:44,545 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 [2019-01-20 09:57:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 09:57:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-20 09:57:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 09:57:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-20 09:57:44,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-20 09:57:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:44,555 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-20 09:57:44,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 09:57:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-20 09:57:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-20 09:57:44,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:44,556 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-20 09:57:44,556 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-01-20 09:57:44,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:44,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:44,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:45,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:45,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:45,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:45,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:45,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:45,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:45,572 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 [2019-01-20 09:57:45,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:45,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:45,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:45,629 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 [2019-01-20 09:57:45,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:45,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:45,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:57:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:45,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-01-20 09:57:45,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:45,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 09:57:45,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 09:57:45,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:45,748 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-01-20 09:57:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:46,977 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-20 09:57:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 09:57:46,978 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-20 09:57:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:46,978 INFO L225 Difference]: With dead ends: 42 [2019-01-20 09:57:46,979 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 09:57:46,980 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 [2019-01-20 09:57:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 09:57:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-20 09:57:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 09:57:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-20 09:57:46,990 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-01-20 09:57:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:46,990 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-20 09:57:46,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 09:57:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-20 09:57:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 09:57:46,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:46,991 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-01-20 09:57:46,991 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-01-20 09:57:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:47,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:47,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:47,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:47,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:47,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-20 09:57:47,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:47,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:47,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-01-20 09:57:47,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:47,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 09:57:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 09:57:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-20 09:57:47,460 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-01-20 09:57:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:47,707 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-20 09:57:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 09:57:47,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-20 09:57:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:47,708 INFO L225 Difference]: With dead ends: 31 [2019-01-20 09:57:47,708 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 09:57:47,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-01-20 09:57:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 09:57:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-20 09:57:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 09:57:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-20 09:57:47,719 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-01-20 09:57:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:47,719 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-20 09:57:47,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 09:57:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-20 09:57:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 09:57:47,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:47,720 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-20 09:57:47,720 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-01-20 09:57:47,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:48,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:48,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:48,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:48,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:48,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:48,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:48,822 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 [2019-01-20 09:57:48,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:57:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 09:57:48,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:48,925 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 [2019-01-20 09:57:48,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:57:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 09:57:49,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:49,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-01-20 09:57:49,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:49,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 09:57:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 09:57:49,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 09:57:49,743 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-01-20 09:57:50,823 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-20 09:57:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:51,875 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-20 09:57:51,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 09:57:51,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-20 09:57:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:51,876 INFO L225 Difference]: With dead ends: 47 [2019-01-20 09:57:51,876 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 09:57:51,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 09:57:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 09:57:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 09:57:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 09:57:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-20 09:57:51,889 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-20 09:57:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:51,889 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-20 09:57:51,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 09:57:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-20 09:57:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 09:57:51,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:51,890 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-20 09:57:51,890 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-01-20 09:57:51,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:51,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:51,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:53,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:53,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:53,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:53,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:53,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:53,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:53,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 09:57:53,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:53,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:53,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:53,774 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 [2019-01-20 09:57:53,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:53,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:53,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:57:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:53,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-01-20 09:57:53,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:53,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 09:57:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 09:57:53,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:53,926 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-01-20 09:57:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:55,327 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-20 09:57:55,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 09:57:55,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-20 09:57:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:55,328 INFO L225 Difference]: With dead ends: 48 [2019-01-20 09:57:55,328 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 09:57:55,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 09:57:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-20 09:57:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 09:57:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-20 09:57:55,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-01-20 09:57:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:55,342 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-20 09:57:55,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 09:57:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-20 09:57:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-20 09:57:55,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:55,343 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-01-20 09:57:55,343 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-01-20 09:57:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:55,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:55,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:55,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:55,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:55,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:55,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:55,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:55,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:55,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:55,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 09:57:55,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:55,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:55,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:56,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:56,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-01-20 09:57:56,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:56,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 09:57:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 09:57:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-01-20 09:57:56,466 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-01-20 09:57:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:56,680 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-20 09:57:56,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 09:57:56,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-20 09:57:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:56,683 INFO L225 Difference]: With dead ends: 35 [2019-01-20 09:57:56,683 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 09:57:56,684 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 [2019-01-20 09:57:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 09:57:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-20 09:57:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 09:57:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-20 09:57:56,698 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-01-20 09:57:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:56,699 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-20 09:57:56,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 09:57:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-20 09:57:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 09:57:56,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:56,700 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-20 09:57:56,700 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-01-20 09:57:56,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:56,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:56,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:57,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:57,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:57,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:57,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:57,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:57,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:57,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:57,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:57,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:57,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:57,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:58,091 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 [2019-01-20 09:57:58,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:57:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 09:57:58,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:58,235 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 [2019-01-20 09:57:58,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:57:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 09:57:58,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:58,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-01-20 09:57:58,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:58,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 09:57:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 09:57:58,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:58,913 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-01-20 09:58:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:00,981 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-20 09:58:00,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 09:58:00,981 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-20 09:58:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:00,982 INFO L225 Difference]: With dead ends: 53 [2019-01-20 09:58:00,983 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 09:58:00,985 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 [2019-01-20 09:58:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 09:58:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-20 09:58:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 09:58:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-20 09:58:00,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-20 09:58:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:00,999 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-20 09:58:00,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 09:58:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-20 09:58:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 09:58:01,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:01,000 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-20 09:58:01,000 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-01-20 09:58:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:01,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:01,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:01,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:01,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:01,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:01,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:01,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:01,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:02,501 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 [2019-01-20 09:58:02,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:02,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:02,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:58:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:02,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:02,568 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 [2019-01-20 09:58:02,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:02,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:02,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:58:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:02,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-01-20 09:58:02,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:02,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 09:58:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 09:58:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 09:58:02,780 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-01-20 09:58:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:04,718 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-20 09:58:04,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 09:58:04,718 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-20 09:58:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:04,718 INFO L225 Difference]: With dead ends: 54 [2019-01-20 09:58:04,718 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 09:58:04,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 09:58:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-20 09:58:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 09:58:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-20 09:58:04,734 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-20 09:58:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:04,735 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-20 09:58:04,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 09:58:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-20 09:58:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-20 09:58:04,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:04,736 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-01-20 09:58:04,737 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:04,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:04,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-01-20 09:58:04,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:04,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:04,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:04,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:04,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:04,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:04,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:04,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:04,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:04,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:05,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 09:58:05,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:05,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:05,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:05,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:05,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-01-20 09:58:05,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:05,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 09:58:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 09:58:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-20 09:58:05,320 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-01-20 09:58:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:05,545 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-20 09:58:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 09:58:05,546 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-20 09:58:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:05,546 INFO L225 Difference]: With dead ends: 39 [2019-01-20 09:58:05,546 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 09:58:05,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 09:58:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 09:58:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-20 09:58:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 09:58:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-20 09:58:05,563 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-20 09:58:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:05,563 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-20 09:58:05,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 09:58:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-20 09:58:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 09:58:05,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:05,564 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-20 09:58:05,564 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-01-20 09:58:05,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:05,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:05,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:05,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:05,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:06,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:06,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:06,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:06,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:06,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:06,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:06,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:06,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:06,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:06,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:06,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:07,221 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 [2019-01-20 09:58:07,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:07,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:07,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:58:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 09:58:07,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:07,345 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 [2019-01-20 09:58:07,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:07,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:07,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:58:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 09:58:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:08,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-01-20 09:58:08,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:08,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 09:58:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 09:58:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:08,194 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-01-20 09:58:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:10,789 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-20 09:58:10,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 09:58:10,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-20 09:58:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:10,791 INFO L225 Difference]: With dead ends: 59 [2019-01-20 09:58:10,791 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 09:58:10,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-01-20 09:58:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 09:58:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-20 09:58:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 09:58:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-20 09:58:10,805 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-20 09:58:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:10,805 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-20 09:58:10,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 09:58:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-20 09:58:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-20 09:58:10,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:10,806 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-20 09:58:10,806 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-01-20 09:58:10,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:11,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:11,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:11,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:11,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:11,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:11,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:11,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:11,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:11,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:12,698 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 [2019-01-20 09:58:12,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:12,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:12,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:58:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:12,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:12,769 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 [2019-01-20 09:58:12,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:12,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:12,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:58:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:13,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:13,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-01-20 09:58:13,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:13,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 09:58:13,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 09:58:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:58:13,034 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-01-20 09:58:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:15,315 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-20 09:58:15,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 09:58:15,315 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-20 09:58:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:15,316 INFO L225 Difference]: With dead ends: 60 [2019-01-20 09:58:15,316 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 09:58:15,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 09:58:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-20 09:58:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 09:58:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-20 09:58:15,331 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-20 09:58:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:15,331 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-20 09:58:15,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 09:58:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-20 09:58:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-20 09:58:15,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:15,332 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-01-20 09:58:15,332 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-01-20 09:58:15,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:15,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:15,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:15,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:15,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:15,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:15,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:15,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:15,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:15,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:15,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:16,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-20 09:58:16,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:16,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:16,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:16,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:16,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-01-20 09:58:16,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:16,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 09:58:16,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 09:58:16,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-20 09:58:16,438 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-01-20 09:58:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:16,703 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-20 09:58:16,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 09:58:16,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-20 09:58:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:16,704 INFO L225 Difference]: With dead ends: 43 [2019-01-20 09:58:16,704 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 09:58:16,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-01-20 09:58:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 09:58:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-20 09:58:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 09:58:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-20 09:58:16,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-20 09:58:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:16,721 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-20 09:58:16,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 09:58:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-20 09:58:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 09:58:16,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:16,722 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-20 09:58:16,722 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-01-20 09:58:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:16,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:16,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:17,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:17,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:17,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:17,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:17,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:17,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:17,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:17,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:17,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:17,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:17,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:18,765 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 [2019-01-20 09:58:18,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:18,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:18,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:58:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 09:58:18,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:18,891 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 [2019-01-20 09:58:18,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:18,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:18,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:58:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 09:58:20,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:20,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-01-20 09:58:20,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:20,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 09:58:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 09:58:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:20,254 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-01-20 09:58:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:22,980 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-20 09:58:22,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 09:58:22,981 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-20 09:58:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:22,981 INFO L225 Difference]: With dead ends: 65 [2019-01-20 09:58:22,981 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 09:58:22,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 09:58:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 09:58:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-20 09:58:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 09:58:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-20 09:58:23,006 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-20 09:58:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:23,006 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-20 09:58:23,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 09:58:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-20 09:58:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-20 09:58:23,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:23,007 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-20 09:58:23,007 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-01-20 09:58:23,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:23,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:23,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:23,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:23,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:24,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:24,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:24,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:24,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:24,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:24,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:24,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:24,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:24,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:25,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 [2019-01-20 09:58:25,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:25,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:25,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:58:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:25,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:25,575 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 [2019-01-20 09:58:25,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:25,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:25,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:58:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:25,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:25,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-01-20 09:58:25,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:25,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 09:58:25,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 09:58:25,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:58:25,930 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-01-20 09:58:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:28,432 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-20 09:58:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 09:58:28,432 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-20 09:58:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:28,433 INFO L225 Difference]: With dead ends: 66 [2019-01-20 09:58:28,433 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 09:58:28,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 09:58:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-20 09:58:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-20 09:58:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-20 09:58:28,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-01-20 09:58:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:28,456 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-20 09:58:28,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 09:58:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-20 09:58:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-20 09:58:28,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:28,457 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-01-20 09:58:28,457 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-01-20 09:58:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:29,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:29,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:29,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:29,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:29,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:29,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 09:58:29,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:29,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:29,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-01-20 09:58:29,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:29,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 09:58:29,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 09:58:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-01-20 09:58:29,547 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-01-20 09:58:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:29,855 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-20 09:58:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 09:58:29,856 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-20 09:58:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:29,856 INFO L225 Difference]: With dead ends: 47 [2019-01-20 09:58:29,856 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 09:58:29,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-01-20 09:58:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 09:58:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-20 09:58:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 09:58:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-20 09:58:29,873 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-01-20 09:58:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:29,873 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-20 09:58:29,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 09:58:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-20 09:58:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 09:58:29,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:29,874 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-20 09:58:29,874 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-01-20 09:58:29,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:29,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:29,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:31,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:31,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:31,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:31,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:31,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:31,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:31,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:31,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:31,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:31,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:31,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:32,353 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 [2019-01-20 09:58:32,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:32,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:32,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:58:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 09:58:32,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:32,501 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 [2019-01-20 09:58:32,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:32,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:32,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:58:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 09:58:33,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:33,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-01-20 09:58:33,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:33,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 09:58:33,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 09:58:33,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:33,772 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-01-20 09:58:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:37,404 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-20 09:58:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 09:58:37,405 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-20 09:58:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:37,406 INFO L225 Difference]: With dead ends: 71 [2019-01-20 09:58:37,406 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 09:58:37,407 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 [2019-01-20 09:58:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 09:58:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-20 09:58:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 09:58:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-20 09:58:37,426 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-20 09:58:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:37,426 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-20 09:58:37,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 09:58:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-20 09:58:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-20 09:58:37,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:37,427 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-20 09:58:37,427 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-01-20 09:58:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:37,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:37,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:39,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:39,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:39,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:39,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:39,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:39,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:39,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:39,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:39,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:40,302 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 [2019-01-20 09:58:40,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:40,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:40,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:58:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:40,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:40,559 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 [2019-01-20 09:58:40,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:40,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:40,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:58:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:41,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:41,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-01-20 09:58:41,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:41,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 09:58:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 09:58:41,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:41,145 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-01-20 09:58:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:44,234 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-20 09:58:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 09:58:44,234 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-01-20 09:58:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:44,235 INFO L225 Difference]: With dead ends: 72 [2019-01-20 09:58:44,235 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 09:58:44,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 09:58:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-20 09:58:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 09:58:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-20 09:58:44,255 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-01-20 09:58:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:44,255 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-20 09:58:44,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 09:58:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-20 09:58:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-20 09:58:44,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:44,256 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-01-20 09:58:44,256 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-01-20 09:58:44,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:44,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:44,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:44,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:44,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:44,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:44,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:44,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:44,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-20 09:58:44,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:44,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:44,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:45,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:45,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-01-20 09:58:45,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:45,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 09:58:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 09:58:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-01-20 09:58:45,243 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-01-20 09:58:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:45,819 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-20 09:58:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 09:58:45,819 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-01-20 09:58:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:45,820 INFO L225 Difference]: With dead ends: 51 [2019-01-20 09:58:45,820 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 09:58:45,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 09:58:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 09:58:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-20 09:58:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 09:58:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-20 09:58:45,840 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-01-20 09:58:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:45,840 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-20 09:58:45,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 09:58:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-20 09:58:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 09:58:45,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:45,841 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-20 09:58:45,841 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-01-20 09:58:45,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:45,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:45,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:47,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:47,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:47,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:47,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:47,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:47,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:47,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:47,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:47,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:47,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:47,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:48,484 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 [2019-01-20 09:58:48,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:48,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:48,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:58:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 09:58:48,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:48,638 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 [2019-01-20 09:58:48,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:48,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:48,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:58:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 09:58:50,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:50,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-01-20 09:58:50,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 09:58:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 09:58:50,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:50,238 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-01-20 09:58:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:54,314 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-20 09:58:54,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 09:58:54,315 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-01-20 09:58:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:54,316 INFO L225 Difference]: With dead ends: 77 [2019-01-20 09:58:54,316 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 09:58:54,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-01-20 09:58:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 09:58:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-20 09:58:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 09:58:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-20 09:58:54,338 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-20 09:58:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:54,338 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-20 09:58:54,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 09:58:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-20 09:58:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 09:58:54,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:54,339 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-20 09:58:54,339 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-01-20 09:58:54,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:54,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:54,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:55,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:55,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:55,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:55,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:55,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:55,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:55,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:55,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:55,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:57,403 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 [2019-01-20 09:58:57,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:57,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:57,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:58:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:57,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:57,488 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 [2019-01-20 09:58:57,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:57,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:57,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:58:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:57,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:57,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-01-20 09:58:57,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:57,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 09:58:58,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 09:58:58,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 09:58:58,000 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-01-20 09:59:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:01,253 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-20 09:59:01,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 09:59:01,254 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-01-20 09:59:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:01,255 INFO L225 Difference]: With dead ends: 78 [2019-01-20 09:59:01,255 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 09:59:01,256 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 [2019-01-20 09:59:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 09:59:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-20 09:59:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 09:59:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-20 09:59:01,279 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-01-20 09:59:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:01,279 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-20 09:59:01,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 09:59:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-20 09:59:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 09:59:01,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:01,280 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-01-20 09:59:01,280 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:01,280 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-01-20 09:59:01,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:01,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:01,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:01,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:01,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:01,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:01,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:01,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:01,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:01,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:01,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:01,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:01,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:01,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 09:59:01,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:01,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:01,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:02,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:02,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-01-20 09:59:02,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:02,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 09:59:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 09:59:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-01-20 09:59:02,412 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-01-20 09:59:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:02,817 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-20 09:59:02,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 09:59:02,817 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-01-20 09:59:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:02,818 INFO L225 Difference]: With dead ends: 55 [2019-01-20 09:59:02,819 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 09:59:02,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-01-20 09:59:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 09:59:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-20 09:59:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 09:59:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-20 09:59:02,840 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-01-20 09:59:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:02,841 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-20 09:59:02,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 09:59:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-20 09:59:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 09:59:02,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:02,842 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-20 09:59:02,842 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:02,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-01-20 09:59:02,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:02,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:02,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:02,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:02,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:04,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:04,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:04,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:04,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:04,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:04,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:04,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:04,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:04,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:04,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:04,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:06,136 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 [2019-01-20 09:59:06,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:06,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:06,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:59:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 09:59:06,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:06,388 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 [2019-01-20 09:59:06,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:06,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:06,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:59:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 09:59:08,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:08,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-01-20 09:59:08,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 09:59:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 09:59:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:59:08,759 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-01-20 09:59:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:13,091 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-20 09:59:13,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 09:59:13,092 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-01-20 09:59:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:13,092 INFO L225 Difference]: With dead ends: 83 [2019-01-20 09:59:13,093 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 09:59:13,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-01-20 09:59:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 09:59:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-20 09:59:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 09:59:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-20 09:59:13,121 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-20 09:59:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:13,121 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-20 09:59:13,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 09:59:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-20 09:59:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-20 09:59:13,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:13,122 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-20 09:59:13,122 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:13,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-01-20 09:59:13,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:13,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:13,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:13,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:14,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:14,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:14,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:14,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:14,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:14,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:15,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:16,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 [2019-01-20 09:59:16,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:16,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:16,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:59:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:16,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:16,999 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 [2019-01-20 09:59:17,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:17,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:17,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:59:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:17,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:17,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-01-20 09:59:17,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:17,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 09:59:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 09:59:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 09:59:17,652 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-01-20 09:59:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:21,697 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-01-20 09:59:21,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 09:59:21,697 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-01-20 09:59:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:21,698 INFO L225 Difference]: With dead ends: 84 [2019-01-20 09:59:21,698 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 09:59:21,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 09:59:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-20 09:59:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 09:59:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-20 09:59:21,725 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-01-20 09:59:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:21,725 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-20 09:59:21,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 09:59:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-20 09:59:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 09:59:21,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:21,726 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-01-20 09:59:21,726 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:21,727 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-01-20 09:59:21,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:21,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:21,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:22,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:22,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:22,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:22,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:22,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:22,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:22,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:22,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:22,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-20 09:59:22,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:22,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:22,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:22,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:22,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-01-20 09:59:22,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:22,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 09:59:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 09:59:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-01-20 09:59:22,952 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-01-20 09:59:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:23,452 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-20 09:59:23,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 09:59:23,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-01-20 09:59:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:23,453 INFO L225 Difference]: With dead ends: 59 [2019-01-20 09:59:23,453 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 09:59:23,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-01-20 09:59:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 09:59:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-20 09:59:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 09:59:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-20 09:59:23,478 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-01-20 09:59:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:23,478 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-20 09:59:23,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 09:59:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-20 09:59:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 09:59:23,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:23,479 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-20 09:59:23,479 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-01-20 09:59:23,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:23,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:25,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:25,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:25,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:25,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:25,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:25,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:25,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:25,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:25,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:27,688 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 [2019-01-20 09:59:27,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:27,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:27,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:59:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 09:59:27,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:27,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 [2019-01-20 09:59:27,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:27,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:27,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:59:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 09:59:29,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:29,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-01-20 09:59:29,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:29,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 09:59:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 09:59:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:29,911 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-01-20 09:59:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:35,117 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-20 09:59:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 09:59:35,117 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-01-20 09:59:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:35,118 INFO L225 Difference]: With dead ends: 89 [2019-01-20 09:59:35,118 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 09:59:35,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-01-20 09:59:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 09:59:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-20 09:59:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 09:59:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-20 09:59:35,147 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-20 09:59:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:35,147 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-20 09:59:35,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 09:59:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-20 09:59:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 09:59:35,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:35,148 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-20 09:59:35,148 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-01-20 09:59:35,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:35,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:35,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:37,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:37,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:37,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:37,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:37,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:37,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:37,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:37,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:37,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:39,231 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 [2019-01-20 09:59:39,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:39,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:39,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 09:59:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:39,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:39,333 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 [2019-01-20 09:59:39,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:39,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:39,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 09:59:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:40,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:40,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-01-20 09:59:40,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:40,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 09:59:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 09:59:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 09:59:40,108 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-01-20 09:59:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:44,793 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-20 09:59:44,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 09:59:44,794 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-01-20 09:59:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:44,795 INFO L225 Difference]: With dead ends: 90 [2019-01-20 09:59:44,795 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 09:59:44,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 09:59:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-20 09:59:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 09:59:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-20 09:59:44,822 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-01-20 09:59:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:44,823 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-20 09:59:44,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 09:59:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-20 09:59:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-20 09:59:44,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:44,823 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-01-20 09:59:44,823 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-01-20 09:59:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:44,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:44,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:45,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:45,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:45,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:45,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:45,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:45,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:45,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:45,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:45,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 09:59:45,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:45,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:45,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:46,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-01-20 09:59:46,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:46,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 09:59:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 09:59:46,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-01-20 09:59:46,120 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-01-20 09:59:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:46,611 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-20 09:59:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 09:59:46,611 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-01-20 09:59:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:46,612 INFO L225 Difference]: With dead ends: 63 [2019-01-20 09:59:46,612 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 09:59:46,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 09:59:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 09:59:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-20 09:59:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 09:59:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-20 09:59:46,642 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-01-20 09:59:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:46,642 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-20 09:59:46,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 09:59:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-20 09:59:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 09:59:46,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:46,643 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-20 09:59:46,643 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-01-20 09:59:46,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:46,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:46,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:46,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:46,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:49,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:49,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:49,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:49,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:49,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:49,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:49,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:49,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:49,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:49,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:49,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:51,005 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 [2019-01-20 09:59:51,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:51,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:51,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 09:59:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 09:59:51,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:51,202 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 [2019-01-20 09:59:51,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:51,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:59:51,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 09:59:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 09:59:53,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:53,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-01-20 09:59:53,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:53,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 09:59:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 09:59:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:53,863 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-01-20 09:59:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:59,469 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-20 09:59:59,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 09:59:59,469 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-01-20 09:59:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:59,470 INFO L225 Difference]: With dead ends: 95 [2019-01-20 09:59:59,470 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 09:59:59,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-01-20 09:59:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 09:59:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-20 09:59:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 09:59:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-20 09:59:59,504 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-20 09:59:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:59,504 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-20 09:59:59,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 09:59:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-20 09:59:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 09:59:59,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:59,504 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-20 09:59:59,504 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-01-20 09:59:59,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:59,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:59,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:01,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:01,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:01,493 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:01,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:01,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:01,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:01,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:01,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:04,016 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 [2019-01-20 10:00:04,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:04,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:04,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:00:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:04,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:04,115 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 [2019-01-20 10:00:04,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:04,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:04,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:00:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:04,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:04,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-01-20 10:00:04,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:04,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:00:04,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:00:04,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:00:04,998 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-01-20 10:00:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:10,213 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-01-20 10:00:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:00:10,214 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-01-20 10:00:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:10,215 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:00:10,215 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 10:00:10,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:00:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 10:00:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-20 10:00:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 10:00:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-20 10:00:10,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-01-20 10:00:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:10,246 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-20 10:00:10,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:00:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-20 10:00:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-20 10:00:10,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:10,247 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-01-20 10:00:10,247 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-01-20 10:00:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:10,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:10,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:10,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:10,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:10,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:10,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:10,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:10,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:10,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 10:00:10,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:10,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:10,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:11,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:11,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-01-20 10:00:11,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 10:00:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 10:00:11,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-01-20 10:00:11,840 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-01-20 10:00:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:12,403 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-20 10:00:12,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:00:12,403 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-01-20 10:00:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:12,403 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:00:12,403 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:00:12,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-01-20 10:00:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:00:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-20 10:00:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 10:00:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-20 10:00:12,435 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-01-20 10:00:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:12,435 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-20 10:00:12,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 10:00:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-20 10:00:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 10:00:12,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:12,436 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-20 10:00:12,436 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:12,436 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-01-20 10:00:12,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:12,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:12,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:12,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:12,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:14,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:14,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:14,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:14,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:14,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:14,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:14,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:14,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:14,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:14,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:14,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:16,899 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 [2019-01-20 10:00:16,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:16,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:16,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:00:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 10:00:16,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:17,093 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 [2019-01-20 10:00:17,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:17,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:17,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:00:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 10:00:19,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:19,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-01-20 10:00:19,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:19,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:00:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:00:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:00:19,933 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-01-20 10:00:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:26,363 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-01-20 10:00:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:00:26,363 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-01-20 10:00:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:26,364 INFO L225 Difference]: With dead ends: 101 [2019-01-20 10:00:26,364 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:00:26,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-01-20 10:00:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:00:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-20 10:00:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:00:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-20 10:00:26,398 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-20 10:00:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:26,399 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-20 10:00:26,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:00:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-20 10:00:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-20 10:00:26,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:26,399 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-20 10:00:26,399 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:26,400 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-01-20 10:00:26,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:26,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:26,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:26,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:26,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:29,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:29,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:29,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:29,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:29,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:29,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:29,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:29,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:29,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:32,808 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 [2019-01-20 10:00:32,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:32,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:32,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:00:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:32,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:32,922 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 [2019-01-20 10:00:32,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:32,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:32,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:00:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:34,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:34,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-01-20 10:00:34,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:34,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:00:34,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:00:34,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 10:00:34,108 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-01-20 10:00:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:39,169 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-20 10:00:39,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:00:39,169 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-01-20 10:00:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:39,170 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:00:39,170 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:00:39,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:00:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-20 10:00:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:00:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-20 10:00:39,210 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-01-20 10:00:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:39,210 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-20 10:00:39,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:00:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-20 10:00:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-20 10:00:39,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:39,211 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-01-20 10:00:39,211 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:39,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:39,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-01-20 10:00:39,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:39,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:39,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:39,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:39,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:39,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:39,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:39,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:39,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:39,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:39,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:39,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:39,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:39,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-20 10:00:39,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:39,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:40,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:41,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:41,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-01-20 10:00:41,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:41,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 10:00:41,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 10:00:41,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 10:00:41,030 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-01-20 10:00:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:41,646 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-01-20 10:00:41,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:00:41,646 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-01-20 10:00:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:41,647 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:00:41,647 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:00:41,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-01-20 10:00:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:00:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-20 10:00:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:00:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-20 10:00:41,683 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-01-20 10:00:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:41,684 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-20 10:00:41,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 10:00:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-20 10:00:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 10:00:41,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:41,684 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-20 10:00:41,684 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-01-20 10:00:41,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:41,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:41,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:44,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:44,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:44,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:44,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:44,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:44,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:44,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:44,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:44,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:44,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:44,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:46,840 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 [2019-01-20 10:00:46,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:46,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:46,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:00:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 10:00:46,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:47,052 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 [2019-01-20 10:00:47,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:47,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:00:47,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:00:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 10:00:50,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:50,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-01-20 10:00:50,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:50,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:00:50,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:00:50,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:50,235 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-01-20 10:00:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:58,135 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-20 10:00:58,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:00:58,135 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-01-20 10:00:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:58,136 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:00:58,136 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:00:58,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-01-20 10:00:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:00:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-20 10:00:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:00:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-20 10:00:58,176 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-20 10:00:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:58,176 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-20 10:00:58,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:00:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-20 10:00:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 10:00:58,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:58,177 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-20 10:00:58,177 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-01-20 10:00:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:58,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:58,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:00,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:00,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:00,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:00,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:00,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:00,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:01,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:01,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:04,010 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 [2019-01-20 10:01:04,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:04,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:04,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:01:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:04,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:04,164 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 [2019-01-20 10:01:04,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:04,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:04,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:01:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:05,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:05,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-01-20 10:01:05,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:05,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:01:05,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:01:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:01:05,251 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-01-20 10:01:07,671 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-20 10:01:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:12,263 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-20 10:01:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:01:12,263 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-01-20 10:01:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:12,264 INFO L225 Difference]: With dead ends: 108 [2019-01-20 10:01:12,264 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:01:12,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:01:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:01:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-20 10:01:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-20 10:01:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-01-20 10:01:12,303 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-01-20 10:01:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:12,303 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-01-20 10:01:12,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:01:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-01-20 10:01:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-20 10:01:12,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:12,304 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-01-20 10:01:12,304 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-01-20 10:01:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:12,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:14,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:14,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:14,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:14,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:14,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:14,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:14,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:14,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:14,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 10:01:14,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:14,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:14,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:15,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:15,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-01-20 10:01:15,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:15,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 10:01:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 10:01:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-01-20 10:01:15,380 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-01-20 10:01:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:16,069 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-20 10:01:16,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:01:16,070 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-01-20 10:01:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:16,070 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:01:16,070 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:01:16,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:01:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:01:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-20 10:01:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:01:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-20 10:01:16,109 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-01-20 10:01:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:16,110 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-20 10:01:16,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 10:01:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-20 10:01:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:01:16,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:16,110 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-20 10:01:16,110 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:16,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-01-20 10:01:16,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:18,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:18,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:18,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:18,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:18,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:18,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:18,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:18,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:22,017 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 [2019-01-20 10:01:22,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:22,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:22,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:01:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 10:01:22,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:22,235 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 [2019-01-20 10:01:22,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:22,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:22,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:01:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 10:01:25,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:25,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-01-20 10:01:25,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:25,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:01:25,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:01:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:01:25,836 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-01-20 10:01:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:33,949 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-20 10:01:33,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-20 10:01:33,949 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-01-20 10:01:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:33,950 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:01:33,950 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:01:33,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:01:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:01:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-20 10:01:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:01:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-20 10:01:33,992 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-20 10:01:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:33,992 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-20 10:01:33,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:01:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-20 10:01:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-20 10:01:33,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:33,993 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-20 10:01:33,993 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-01-20 10:01:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:33,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:33,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:36,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:36,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:36,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:36,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:36,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:36,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:36,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:36,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:37,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:40,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:01:40,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:40,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:40,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:01:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:40,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:40,342 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 [2019-01-20 10:01:40,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:40,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:40,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:01:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:41,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:41,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-01-20 10:01:41,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:41,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-20 10:01:41,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-20 10:01:41,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:01:41,528 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-01-20 10:01:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:48,289 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-01-20 10:01:48,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:01:48,289 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-01-20 10:01:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:48,290 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:01:48,290 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:01:48,291 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 [2019-01-20 10:01:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:01:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-20 10:01:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:01:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-01-20 10:01:48,333 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-01-20 10:01:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:48,334 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-01-20 10:01:48,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-20 10:01:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-01-20 10:01:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-20 10:01:48,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:48,334 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-01-20 10:01:48,335 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-01-20 10:01:48,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:48,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:48,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:49,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:49,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:49,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:49,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:49,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:49,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:49,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:49,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:49,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-20 10:01:49,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:49,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:49,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:50,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:50,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-01-20 10:01:50,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:50,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 10:01:50,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 10:01:50,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-01-20 10:01:50,894 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-01-20 10:01:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:51,629 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-01-20 10:01:51,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:01:51,629 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-01-20 10:01:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:51,630 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:01:51,631 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:01:51,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-01-20 10:01:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:01:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-20 10:01:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:01:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-20 10:01:51,692 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-01-20 10:01:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:51,693 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-20 10:01:51,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 10:01:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-20 10:01:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 10:01:51,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:51,693 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-20 10:01:51,694 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-01-20 10:01:51,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:51,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:51,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:51,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:54,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:54,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:54,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:54,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:54,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:54,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:54,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:54,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:54,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:57,972 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 [2019-01-20 10:01:57,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:01:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 10:01:58,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:58,205 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 [2019-01-20 10:01:58,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:58,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:58,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:02:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 10:02:02,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:02,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-01-20 10:02:02,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:02,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:02:02,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:02:02,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:02:02,266 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-01-20 10:02:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:12,096 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-01-20 10:02:12,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-20 10:02:12,097 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-01-20 10:02:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:12,098 INFO L225 Difference]: With dead ends: 119 [2019-01-20 10:02:12,098 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:02:12,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-01-20 10:02:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:02:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-20 10:02:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 10:02:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-20 10:02:12,164 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-20 10:02:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:12,164 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-20 10:02:12,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:02:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-20 10:02:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-20 10:02:12,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:12,165 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-20 10:02:12,165 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:12,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-01-20 10:02:12,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:12,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:12,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:16,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:16,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:16,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:16,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:16,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:16,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:16,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:16,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:16,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:19,697 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 [2019-01-20 10:02:19,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:02:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:19,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:19,822 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 [2019-01-20 10:02:19,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:02:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:21,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:21,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-01-20 10:02:21,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:21,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-20 10:02:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-20 10:02:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:02:21,300 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-01-20 10:02:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:29,480 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-01-20 10:02:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:02:29,480 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-01-20 10:02:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:29,481 INFO L225 Difference]: With dead ends: 120 [2019-01-20 10:02:29,481 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:02:29,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:02:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-20 10:02:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:02:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-20 10:02:29,535 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-01-20 10:02:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:29,535 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-20 10:02:29,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-20 10:02:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-20 10:02:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 10:02:29,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:29,536 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-01-20 10:02:29,536 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-01-20 10:02:29,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:29,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:29,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:31,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:31,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:31,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:31,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:31,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:31,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:31,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:31,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:31,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 10:02:31,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:31,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:31,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:32,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:32,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-01-20 10:02:32,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:32,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 10:02:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 10:02:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 10:02:32,626 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-01-20 10:02:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:33,446 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-20 10:02:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:02:33,447 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-01-20 10:02:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:33,447 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:02:33,447 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:02:33,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-01-20 10:02:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:02:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-20 10:02:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:02:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-20 10:02:33,496 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-01-20 10:02:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:33,496 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-20 10:02:33,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 10:02:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-20 10:02:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 10:02:33,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:33,497 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-20 10:02:33,497 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-01-20 10:02:33,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:33,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:33,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:37,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:37,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:37,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:37,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:37,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:37,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:37,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:37,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:37,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:37,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:37,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:42,315 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 [2019-01-20 10:02:42,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:02:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 10:02:42,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:42,565 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 [2019-01-20 10:02:42,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:02:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 10:02:47,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:47,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-01-20 10:02:47,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:47,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-20 10:02:47,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-20 10:02:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:47,009 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-01-20 10:02:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:57,182 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-20 10:02:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-20 10:02:57,183 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-01-20 10:02:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:57,184 INFO L225 Difference]: With dead ends: 125 [2019-01-20 10:02:57,184 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:02:57,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-01-20 10:02:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:02:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-20 10:02:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:02:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-20 10:02:57,244 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-20 10:02:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:57,244 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-20 10:02:57,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-20 10:02:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-20 10:02:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-20 10:02:57,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:57,245 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-20 10:02:57,245 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-01-20 10:02:57,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:57,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:57,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:57,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:57,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:01,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:01,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:01,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:01,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:01,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:01,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:01,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:01,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:01,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:05,002 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 [2019-01-20 10:03:05,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:05,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:05,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:03:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:05,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:05,132 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 [2019-01-20 10:03:05,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:05,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:05,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:03:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:06,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:06,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-01-20 10:03:06,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:06,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-20 10:03:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-20 10:03:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:03:06,571 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-01-20 10:03:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:15,478 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-01-20 10:03:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:03:15,479 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-01-20 10:03:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:15,479 INFO L225 Difference]: With dead ends: 126 [2019-01-20 10:03:15,480 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 10:03:15,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:03:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 10:03:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-20 10:03:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:03:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-20 10:03:15,531 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-01-20 10:03:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:15,532 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-20 10:03:15,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-20 10:03:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-20 10:03:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 10:03:15,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:15,532 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-01-20 10:03:15,533 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-01-20 10:03:15,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:15,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:15,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:15,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:16,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:16,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:16,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:16,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:16,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:16,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:16,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:16,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:16,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-20 10:03:16,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:16,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:16,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:18,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:18,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-01-20 10:03:18,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:18,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 10:03:18,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 10:03:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-01-20 10:03:18,191 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-01-20 10:03:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:19,027 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-20 10:03:19,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:03:19,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-01-20 10:03:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:19,028 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:03:19,028 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:03:19,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-01-20 10:03:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:03:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-20 10:03:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 10:03:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-20 10:03:19,082 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-01-20 10:03:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:19,082 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-20 10:03:19,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 10:03:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-20 10:03:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 10:03:19,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:19,083 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-20 10:03:19,083 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-01-20 10:03:19,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:19,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:19,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:22,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:22,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:22,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:22,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:22,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:22,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:22,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:22,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:22,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:22,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:22,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:26,579 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 [2019-01-20 10:03:26,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:26,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:26,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:03:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 10:03:26,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:26,823 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 [2019-01-20 10:03:26,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:26,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:26,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:03:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 10:03:31,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:31,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-01-20 10:03:31,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:31,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-20 10:03:31,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-20 10:03:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:03:31,583 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-01-20 10:03:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:43,100 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-20 10:03:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-01-20 10:03:43,100 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-01-20 10:03:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:43,101 INFO L225 Difference]: With dead ends: 131 [2019-01-20 10:03:43,101 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:03:43,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-01-20 10:03:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:03:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-20 10:03:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 10:03:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-20 10:03:43,164 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-20 10:03:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:43,165 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-20 10:03:43,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-20 10:03:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-20 10:03:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 10:03:43,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:43,165 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-20 10:03:43,165 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:43,165 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-01-20 10:03:43,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:43,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:43,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:47,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:47,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:47,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:47,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:47,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:47,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:47,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:47,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:47,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:51,528 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 [2019-01-20 10:03:51,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:51,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:51,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:03:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:51,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:51,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 [2019-01-20 10:03:51,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:51,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:51,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:03:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:53,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:53,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-01-20 10:03:53,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:53,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-20 10:03:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-20 10:03:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:03:53,564 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-01-20 10:04:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:03,357 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-01-20 10:04:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:04:03,357 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-01-20 10:04:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:03,358 INFO L225 Difference]: With dead ends: 132 [2019-01-20 10:04:03,358 INFO L226 Difference]: Without dead ends: 88 [2019-01-20 10:04:03,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:04:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-20 10:04:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-20 10:04:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-20 10:04:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-01-20 10:04:03,416 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-01-20 10:04:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:03,416 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-01-20 10:04:03,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-20 10:04:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-01-20 10:04:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-20 10:04:03,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:03,417 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-01-20 10:04:03,417 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:03,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:03,417 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-01-20 10:04:03,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:03,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:03,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:03,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:03,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:04,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:04,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:04,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:04,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:04,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:04,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:04,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:04,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 10:04:04,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:04,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:04,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:05,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:05,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-01-20 10:04:05,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:05,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 10:04:05,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 10:04:05,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-01-20 10:04:05,901 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-01-20 10:04:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:06,802 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-01-20 10:04:06,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:04:06,802 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-01-20 10:04:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:06,803 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:04:06,803 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:04:06,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-01-20 10:04:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:04:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-20 10:04:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:04:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-20 10:04:06,897 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-01-20 10:04:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:06,897 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-20 10:04:06,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 10:04:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-20 10:04:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 10:04:06,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:06,898 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-20 10:04:06,898 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-01-20 10:04:06,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:06,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:06,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:11,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:11,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:11,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:11,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:11,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:11,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:11,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:11,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:11,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:11,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:11,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:15,694 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 [2019-01-20 10:04:15,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:15,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:04:15,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:04:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 10:04:15,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:15,947 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 [2019-01-20 10:04:15,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:15,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:04:15,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:04:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 10:04:21,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:21,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-01-20 10:04:21,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:21,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-20 10:04:21,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-20 10:04:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:04:21,212 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-01-20 10:04:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:33,570 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-01-20 10:04:33,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-01-20 10:04:33,570 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-01-20 10:04:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:33,571 INFO L225 Difference]: With dead ends: 137 [2019-01-20 10:04:33,571 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 10:04:33,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-01-20 10:04:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 10:04:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-20 10:04:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:04:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-20 10:04:33,634 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-20 10:04:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:33,635 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-20 10:04:33,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-20 10:04:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-20 10:04:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 10:04:33,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:33,635 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-20 10:04:33,635 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-01-20 10:04:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:33,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:33,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:37,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:37,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:37,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:37,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:37,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:37,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:37,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:37,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:37,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:42,142 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 [2019-01-20 10:04:42,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:42,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:04:42,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:04:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:42,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:42,298 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 [2019-01-20 10:04:42,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:42,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:04:42,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:04:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:44,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-01-20 10:04:44,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:44,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-20 10:04:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-20 10:04:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:04:44,207 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-01-20 10:04:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:54,942 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-01-20 10:04:54,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:04:54,942 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-01-20 10:04:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:54,943 INFO L225 Difference]: With dead ends: 138 [2019-01-20 10:04:54,943 INFO L226 Difference]: Without dead ends: 92 [2019-01-20 10:04:54,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:04:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-20 10:04:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-20 10:04:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:04:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-01-20 10:04:55,003 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-01-20 10:04:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:55,003 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-01-20 10:04:55,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-20 10:04:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-01-20 10:04:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-20 10:04:55,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:55,003 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-01-20 10:04:55,003 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:55,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-01-20 10:04:55,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:55,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:55,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:55,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:55,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:55,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:55,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:55,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:55,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:55,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:55,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:55,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:55,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:56,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-20 10:04:56,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:56,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:56,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:57,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:57,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-01-20 10:04:57,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:57,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:04:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:04:57,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 10:04:57,732 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-01-20 10:04:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:58,726 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-01-20 10:04:58,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:04:58,726 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-01-20 10:04:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:58,727 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:04:58,727 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:04:58,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-01-20 10:04:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:04:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-20 10:04:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:04:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-20 10:04:58,793 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-01-20 10:04:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:58,794 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-20 10:04:58,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:04:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-20 10:04:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 10:04:58,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:58,794 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-20 10:04:58,794 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-01-20 10:04:58,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:58,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:58,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:03,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:03,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:03,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:03,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:03,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:03,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:03,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:03,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:03,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:03,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:03,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:07,989 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 [2019-01-20 10:05:07,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:05:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 10:05:08,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:08,265 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 [2019-01-20 10:05:08,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:08,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:08,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:05:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 10:05:14,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:14,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-01-20 10:05:14,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:14,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-20 10:05:14,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-20 10:05:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:05:14,109 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-01-20 10:05:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:27,328 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-01-20 10:05:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-01-20 10:05:27,328 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-01-20 10:05:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:27,329 INFO L225 Difference]: With dead ends: 143 [2019-01-20 10:05:27,329 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 10:05:27,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-01-20 10:05:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 10:05:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-20 10:05:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:05:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-20 10:05:27,398 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-20 10:05:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:27,398 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-20 10:05:27,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-20 10:05:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-20 10:05:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-20 10:05:27,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:27,399 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-20 10:05:27,399 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-01-20 10:05:27,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:27,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:27,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:27,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:27,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:31,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:31,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:31,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:31,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:31,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:31,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:31,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:31,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:31,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:36,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:05:36,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:05:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:36,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:36,994 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 [2019-01-20 10:05:36,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:05:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:38,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:38,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-01-20 10:05:38,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:38,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-20 10:05:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-20 10:05:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:05:38,897 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-01-20 10:05:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:50,223 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-01-20 10:05:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:05:50,223 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-01-20 10:05:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:50,224 INFO L225 Difference]: With dead ends: 144 [2019-01-20 10:05:50,224 INFO L226 Difference]: Without dead ends: 96 [2019-01-20 10:05:50,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:05:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-20 10:05:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-20 10:05:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:05:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-01-20 10:05:50,291 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-01-20 10:05:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:50,291 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-01-20 10:05:50,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-20 10:05:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-01-20 10:05:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-20 10:05:50,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:50,292 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-01-20 10:05:50,292 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:50,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:50,292 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-01-20 10:05:50,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:50,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:50,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:50,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:50,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:51,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:51,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:51,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:51,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:51,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:51,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:51,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:51,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:51,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 10:05:51,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:51,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:51,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:53,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:53,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-01-20 10:05:53,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:53,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 10:05:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 10:05:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-01-20 10:05:53,541 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-01-20 10:05:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:54,625 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-01-20 10:05:54,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:05:54,626 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-01-20 10:05:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:54,626 INFO L225 Difference]: With dead ends: 99 [2019-01-20 10:05:54,626 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:05:54,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:05:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:05:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-20 10:05:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:05:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-20 10:05:54,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-01-20 10:05:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:54,695 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-20 10:05:54,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 10:05:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-20 10:05:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 10:05:54,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:54,695 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-20 10:05:54,695 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-01-20 10:05:54,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:54,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:54,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:54,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:54,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:59,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:59,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:59,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:59,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:59,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:59,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:59,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:59,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:59,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:59,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:59,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:04,451 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 [2019-01-20 10:06:04,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:06:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 10:06:04,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:04,738 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 [2019-01-20 10:06:04,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:06:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 10:06:11,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:11,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-01-20 10:06:11,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:11,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-01-20 10:06:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-01-20 10:06:11,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:06:11,189 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-01-20 10:06:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:25,908 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-01-20 10:06:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-01-20 10:06:25,909 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-01-20 10:06:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:25,909 INFO L225 Difference]: With dead ends: 149 [2019-01-20 10:06:25,910 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:06:25,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-01-20 10:06:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:06:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-20 10:06:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-20 10:06:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-20 10:06:25,985 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-20 10:06:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:25,985 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-20 10:06:25,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-01-20 10:06:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-20 10:06:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-20 10:06:25,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:25,986 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-20 10:06:25,986 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-01-20 10:06:25,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:25,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:25,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:25,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:25,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:30,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:30,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:30,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:30,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:30,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:30,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:30,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:30,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:36,134 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 [2019-01-20 10:06:36,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:36,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:36,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:06:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:36,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:36,325 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 [2019-01-20 10:06:36,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:36,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:36,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:06:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:38,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:38,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-01-20 10:06:38,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:38,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-20 10:06:38,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-20 10:06:38,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:06:38,756 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-01-20 10:06:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:49,906 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-01-20 10:06:49,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:06:49,906 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-01-20 10:06:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:49,907 INFO L225 Difference]: With dead ends: 150 [2019-01-20 10:06:49,907 INFO L226 Difference]: Without dead ends: 100 [2019-01-20 10:06:49,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:06:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-20 10:06:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-20 10:06:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:06:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-20 10:06:49,980 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-01-20 10:06:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:49,980 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-20 10:06:49,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-20 10:06:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-20 10:06:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-20 10:06:49,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:49,981 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-01-20 10:06:49,981 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:49,981 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-01-20 10:06:49,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:49,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:49,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:49,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:49,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:50,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:50,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:50,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:50,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:50,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:50,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:50,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:50,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:51,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 10:06:51,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:51,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:51,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:53,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:53,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-01-20 10:06:53,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:53,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 10:06:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 10:06:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-01-20 10:06:53,537 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-01-20 10:06:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:54,707 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-20 10:06:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:06:54,708 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-20 10:06:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:54,708 INFO L225 Difference]: With dead ends: 103 [2019-01-20 10:06:54,708 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:06:54,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-01-20 10:06:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:06:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-20 10:06:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:06:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-20 10:06:54,783 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-01-20 10:06:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:54,784 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-20 10:06:54,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 10:06:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-20 10:06:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:06:54,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:54,784 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-20 10:06:54,784 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-01-20 10:06:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:54,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:54,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:59,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:59,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:59,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:59,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:59,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:59,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:59,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:59,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:59,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:59,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:05,467 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 [2019-01-20 10:07:05,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:05,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:05,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:07:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 10:07:05,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:05,757 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 [2019-01-20 10:07:05,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:05,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:05,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:07:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 10:07:12,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:12,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-01-20 10:07:12,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:12,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-01-20 10:07:12,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-01-20 10:07:12,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:07:12,921 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-01-20 10:07:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:28,575 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-01-20 10:07:28,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-01-20 10:07:28,575 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-01-20 10:07:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:28,576 INFO L225 Difference]: With dead ends: 155 [2019-01-20 10:07:28,576 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:07:28,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-01-20 10:07:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:07:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-20 10:07:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:07:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-20 10:07:28,652 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-20 10:07:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:28,653 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-20 10:07:28,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-01-20 10:07:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-20 10:07:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-20 10:07:28,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:28,653 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-20 10:07:28,653 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-01-20 10:07:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:28,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:28,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:28,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:28,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:33,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:33,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:33,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:33,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:33,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:33,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:33,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:33,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:33,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:39,905 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 [2019-01-20 10:07:39,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:39,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:39,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:07:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:40,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:40,087 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 [2019-01-20 10:07:40,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:07:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:42,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:42,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-01-20 10:07:42,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:42,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-20 10:07:42,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-20 10:07:42,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:07:42,419 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-01-20 10:07:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:54,908 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-01-20 10:07:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-20 10:07:54,908 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-01-20 10:07:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:54,909 INFO L225 Difference]: With dead ends: 156 [2019-01-20 10:07:54,909 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 10:07:54,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:07:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 10:07:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-20 10:07:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:07:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-20 10:07:54,989 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-01-20 10:07:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:54,989 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-20 10:07:54,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-20 10:07:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-20 10:07:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-20 10:07:54,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:54,989 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-01-20 10:07:54,990 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-01-20 10:07:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:54,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:54,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:54,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:54,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:56,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:56,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:56,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:56,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:56,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:56,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:56,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:56,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:56,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-20 10:07:56,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:56,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:56,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:58,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:58,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-01-20 10:07:58,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:58,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:07:58,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:07:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 10:07:58,903 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-01-20 10:08:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:00,164 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-01-20 10:08:00,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:08:00,164 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-01-20 10:08:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:00,165 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:08:00,165 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:08:00,166 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 [2019-01-20 10:08:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:08:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-20 10:08:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:08:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-20 10:08:00,248 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-01-20 10:08:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:00,248 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-20 10:08:00,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:08:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-20 10:08:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:08:00,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:00,249 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-20 10:08:00,250 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:00,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-01-20 10:08:00,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:00,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:00,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:05,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:05,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:05,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:05,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:05,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:05,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:05,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:05,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:05,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:05,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:05,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:11,546 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 [2019-01-20 10:08:11,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:11,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:11,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:08:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 10:08:11,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:11,852 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 [2019-01-20 10:08:11,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:11,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:11,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:08:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 10:08:18,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:18,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-01-20 10:08:18,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:18,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-20 10:08:18,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-20 10:08:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:08:18,948 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-01-20 10:08:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:35,277 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-20 10:08:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-01-20 10:08:35,277 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-01-20 10:08:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:35,278 INFO L225 Difference]: With dead ends: 161 [2019-01-20 10:08:35,278 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:08:35,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-01-20 10:08:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:08:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-20 10:08:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:08:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-20 10:08:35,360 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-20 10:08:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:35,360 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-20 10:08:35,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-20 10:08:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-20 10:08:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-20 10:08:35,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:35,361 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-20 10:08:35,361 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-01-20 10:08:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:35,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:35,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:40,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:40,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:40,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:40,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:40,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:40,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:40,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:40,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:41,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:47,541 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 [2019-01-20 10:08:47,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:47,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:47,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:08:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:47,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:47,727 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 [2019-01-20 10:08:47,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:47,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:47,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:08:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:50,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:50,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-01-20 10:08:50,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:50,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-20 10:08:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-20 10:08:50,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:08:50,760 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-01-20 10:09:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:03,742 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-01-20 10:09:03,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-20 10:09:03,742 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-01-20 10:09:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:03,743 INFO L225 Difference]: With dead ends: 162 [2019-01-20 10:09:03,743 INFO L226 Difference]: Without dead ends: 108 [2019-01-20 10:09:03,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:09:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-20 10:09:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-20 10:09:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 10:09:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-01-20 10:09:03,825 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-01-20 10:09:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:03,825 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-01-20 10:09:03,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-20 10:09:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-01-20 10:09:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-20 10:09:03,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:03,826 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-01-20 10:09:03,826 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:03,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-01-20 10:09:03,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:03,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:03,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:03,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:03,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:05,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:05,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:05,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:05,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:05,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:05,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:05,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:05,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-20 10:09:05,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:05,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:05,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:07,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:07,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-01-20 10:09:07,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:07,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 10:09:07,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 10:09:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-01-20 10:09:07,931 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-01-20 10:09:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:09,141 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-01-20 10:09:09,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-20 10:09:09,141 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-01-20 10:09:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:09,142 INFO L225 Difference]: With dead ends: 111 [2019-01-20 10:09:09,142 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:09:09,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 10:09:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:09:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-20 10:09:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 10:09:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-20 10:09:09,225 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-01-20 10:09:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:09,226 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-20 10:09:09,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 10:09:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-20 10:09:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 10:09:09,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:09,226 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-20 10:09:09,226 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:09,227 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-01-20 10:09:09,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:09,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:09,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:09,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:09,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:14,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:14,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:14,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:14,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:14,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:14,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:15,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:15,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:15,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:22,401 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 [2019-01-20 10:09:22,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:09:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 10:09:22,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:22,724 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 [2019-01-20 10:09:22,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:09:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 10:09:30,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:30,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-01-20 10:09:30,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:30,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-01-20 10:09:30,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-01-20 10:09:30,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:09:30,953 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-01-20 10:09:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:48,886 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-01-20 10:09:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-01-20 10:09:48,886 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-01-20 10:09:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:48,887 INFO L225 Difference]: With dead ends: 167 [2019-01-20 10:09:48,887 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 10:09:48,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-01-20 10:09:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 10:09:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-20 10:09:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 10:09:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-20 10:09:48,975 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-20 10:09:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:48,975 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-20 10:09:48,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-01-20 10:09:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-20 10:09:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-20 10:09:48,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:48,975 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-20 10:09:48,976 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-01-20 10:09:48,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:48,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:48,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:54,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:54,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:54,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:54,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:54,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:54,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:01,698 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 [2019-01-20 10:10:01,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:10:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:01,867 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 [2019-01-20 10:10:01,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:10:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:04,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:04,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2019-01-20 10:10:04,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:04,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-20 10:10:04,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-20 10:10:04,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:10:04,597 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states.